/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_floodmax.3.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:36:53,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:36:53,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:36:53,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:36:53,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:36:53,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:36:53,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:36:53,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:36:53,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:36:53,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:36:53,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:36:53,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:36:53,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:36:53,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:36:53,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:36:53,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:36:53,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:36:53,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:36:53,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:36:53,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:36:53,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:36:53,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:36:53,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:36:53,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:36:53,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:36:53,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:36:53,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:36:53,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:36:53,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:36:53,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:36:53,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:36:53,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:36:53,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:36:53,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:36:53,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:36:53,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:36:53,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:36:53,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:36:53,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:36:53,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:36:53,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:36:53,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:36:53,575 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:36:53,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:36:53,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:36:53,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:36:53,583 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:36:53,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:36:53,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:36:53,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:36:53,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:36:53,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:36:53,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:36:53,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:36:53,587 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:36:53,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:36:53,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:36:53,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:36:53,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:36:53,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:36:53,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:36:53,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:36:53,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:36:53,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:36:53,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:36:53,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:36:53,590 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:36:53,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:36:54,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:36:54,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:36:54,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:36:54,159 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:36:54,160 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:36:54,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c [2021-01-06 19:36:54,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a090221b2/5060037f1a30465c93b721e9e329f49e/FLAGffc5a88e5 [2021-01-06 19:36:55,154 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:36:55,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c [2021-01-06 19:36:55,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a090221b2/5060037f1a30465c93b721e9e329f49e/FLAGffc5a88e5 [2021-01-06 19:36:55,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a090221b2/5060037f1a30465c93b721e9e329f49e [2021-01-06 19:36:55,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:36:55,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:36:55,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:36:55,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:36:55,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:36:55,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:36:55" (1/1) ... [2021-01-06 19:36:55,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2533f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:55, skipping insertion in model container [2021-01-06 19:36:55,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:36:55" (1/1) ... [2021-01-06 19:36:55,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:36:55,537 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:36:55,845 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_floodmax.3.ufo.BOUNDED-6.pals.c[12762,12775] [2021-01-06 19:36:55,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:36:55,898 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:36:56,103 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_floodmax.3.ufo.BOUNDED-6.pals.c[12762,12775] [2021-01-06 19:36:56,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:36:56,148 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:36:56,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56 WrapperNode [2021-01-06 19:36:56,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:36:56,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:36:56,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:36:56,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:36:56,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (1/1) ... [2021-01-06 19:36:56,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (1/1) ... [2021-01-06 19:36:56,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:36:56,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:36:56,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:36:56,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:36:56,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (1/1) ... [2021-01-06 19:36:56,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (1/1) ... [2021-01-06 19:36:56,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (1/1) ... [2021-01-06 19:36:56,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (1/1) ... [2021-01-06 19:36:56,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (1/1) ... [2021-01-06 19:36:56,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (1/1) ... [2021-01-06 19:36:56,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (1/1) ... [2021-01-06 19:36:56,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:36:56,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:36:56,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:36:56,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:36:56,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:36:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:36:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:36:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:36:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:36:57,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:36:57,665 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-01-06 19:36:57,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:36:57 BoogieIcfgContainer [2021-01-06 19:36:57,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:36:57,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:36:57,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:36:57,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:36:57,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:36:55" (1/3) ... [2021-01-06 19:36:57,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5c12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:36:57, skipping insertion in model container [2021-01-06 19:36:57,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:56" (2/3) ... [2021-01-06 19:36:57,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5c12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:36:57, skipping insertion in model container [2021-01-06 19:36:57,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:36:57" (3/3) ... [2021-01-06 19:36:57,683 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c [2021-01-06 19:36:57,694 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:36:57,706 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:36:57,754 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:36:57,791 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:36:57,792 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:36:57,792 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:36:57,792 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:36:57,792 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:36:57,792 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:36:57,793 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:36:57,793 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:36:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2021-01-06 19:36:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:36:57,838 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:57,842 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] [2021-01-06 19:36:57,843 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:57,859 INFO L82 PathProgramCache]: Analyzing trace with hash -306716250, now seen corresponding path program 1 times [2021-01-06 19:36:57,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:57,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878563428] [2021-01-06 19:36:57,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:58,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878563428] [2021-01-06 19:36:58,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:58,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:36:58,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339663803] [2021-01-06 19:36:58,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:36:58,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:58,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:36:58,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:36:58,322 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2021-01-06 19:36:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:58,372 INFO L93 Difference]: Finished difference Result 206 states and 352 transitions. [2021-01-06 19:36:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:36:58,374 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2021-01-06 19:36:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:58,394 INFO L225 Difference]: With dead ends: 206 [2021-01-06 19:36:58,395 INFO L226 Difference]: Without dead ends: 127 [2021-01-06 19:36:58,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:36:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-01-06 19:36:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-01-06 19:36:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-01-06 19:36:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2021-01-06 19:36:58,476 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 37 [2021-01-06 19:36:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:58,477 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2021-01-06 19:36:58,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:36:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2021-01-06 19:36:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:36:58,480 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:58,481 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] [2021-01-06 19:36:58,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:36:58,481 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:58,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:58,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1124364700, now seen corresponding path program 1 times [2021-01-06 19:36:58,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:58,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155202645] [2021-01-06 19:36:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:58,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155202645] [2021-01-06 19:36:58,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:58,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:36:58,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069448636] [2021-01-06 19:36:58,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:36:58,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:58,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:36:58,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:36:58,712 INFO L87 Difference]: Start difference. First operand 127 states and 220 transitions. Second operand 5 states. [2021-01-06 19:36:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:58,958 INFO L93 Difference]: Finished difference Result 271 states and 460 transitions. [2021-01-06 19:36:58,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:36:58,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:36:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:58,962 INFO L225 Difference]: With dead ends: 271 [2021-01-06 19:36:58,963 INFO L226 Difference]: Without dead ends: 197 [2021-01-06 19:36:58,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:36:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-01-06 19:36:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2021-01-06 19:36:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-01-06 19:36:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2021-01-06 19:36:59,003 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 37 [2021-01-06 19:36:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:59,004 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2021-01-06 19:36:59,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:36:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2021-01-06 19:36:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:36:59,013 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:59,014 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] [2021-01-06 19:36:59,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:36:59,014 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:59,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1313145683, now seen corresponding path program 1 times [2021-01-06 19:36:59,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:59,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715741006] [2021-01-06 19:36:59,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:59,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715741006] [2021-01-06 19:36:59,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:59,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:59,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094460351] [2021-01-06 19:36:59,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:59,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:59,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:59,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:59,323 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand 3 states. [2021-01-06 19:36:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:59,406 INFO L93 Difference]: Finished difference Result 258 states and 412 transitions. [2021-01-06 19:36:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:59,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:36:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:59,410 INFO L225 Difference]: With dead ends: 258 [2021-01-06 19:36:59,411 INFO L226 Difference]: Without dead ends: 188 [2021-01-06 19:36:59,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-06 19:36:59,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2021-01-06 19:36:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-01-06 19:36:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2021-01-06 19:36:59,461 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 63 [2021-01-06 19:36:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:59,461 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2021-01-06 19:36:59,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2021-01-06 19:36:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:36:59,466 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:59,466 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] [2021-01-06 19:36:59,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:36:59,467 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:59,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:59,468 INFO L82 PathProgramCache]: Analyzing trace with hash -255493166, now seen corresponding path program 1 times [2021-01-06 19:36:59,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:59,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647414799] [2021-01-06 19:36:59,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:59,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647414799] [2021-01-06 19:36:59,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:59,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:59,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496665287] [2021-01-06 19:36:59,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:59,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:59,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:59,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:59,605 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2021-01-06 19:36:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:59,638 INFO L93 Difference]: Finished difference Result 313 states and 501 transitions. [2021-01-06 19:36:59,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:59,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:36:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:59,641 INFO L225 Difference]: With dead ends: 313 [2021-01-06 19:36:59,641 INFO L226 Difference]: Without dead ends: 243 [2021-01-06 19:36:59,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-01-06 19:36:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2021-01-06 19:36:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2021-01-06 19:36:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 380 transitions. [2021-01-06 19:36:59,666 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 380 transitions. Word has length 65 [2021-01-06 19:36:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:59,667 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 380 transitions. [2021-01-06 19:36:59,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 380 transitions. [2021-01-06 19:36:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:36:59,669 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:59,670 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] [2021-01-06 19:36:59,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:36:59,670 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1395779292, now seen corresponding path program 1 times [2021-01-06 19:36:59,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:59,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104445426] [2021-01-06 19:36:59,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:59,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104445426] [2021-01-06 19:36:59,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:59,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:59,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172146636] [2021-01-06 19:36:59,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:59,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:59,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:59,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:59,847 INFO L87 Difference]: Start difference. First operand 241 states and 380 transitions. Second operand 3 states. [2021-01-06 19:36:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:59,894 INFO L93 Difference]: Finished difference Result 584 states and 947 transitions. [2021-01-06 19:36:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:59,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:36:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:59,900 INFO L225 Difference]: With dead ends: 584 [2021-01-06 19:36:59,900 INFO L226 Difference]: Without dead ends: 402 [2021-01-06 19:36:59,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-01-06 19:36:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2021-01-06 19:36:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2021-01-06 19:36:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 640 transitions. [2021-01-06 19:36:59,940 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 640 transitions. Word has length 65 [2021-01-06 19:36:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:59,941 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 640 transitions. [2021-01-06 19:36:59,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 640 transitions. [2021-01-06 19:36:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:36:59,944 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:59,945 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] [2021-01-06 19:36:59,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:36:59,945 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:59,946 INFO L82 PathProgramCache]: Analyzing trace with hash -812427391, now seen corresponding path program 1 times [2021-01-06 19:36:59,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:59,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817672109] [2021-01-06 19:36:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:00,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817672109] [2021-01-06 19:37:00,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:00,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:00,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348204498] [2021-01-06 19:37:00,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:00,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:00,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:00,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:00,019 INFO L87 Difference]: Start difference. First operand 400 states and 640 transitions. Second operand 3 states. [2021-01-06 19:37:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:00,055 INFO L93 Difference]: Finished difference Result 729 states and 1183 transitions. [2021-01-06 19:37:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:00,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:37:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:00,061 INFO L225 Difference]: With dead ends: 729 [2021-01-06 19:37:00,061 INFO L226 Difference]: Without dead ends: 547 [2021-01-06 19:37:00,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-01-06 19:37:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2021-01-06 19:37:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2021-01-06 19:37:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 875 transitions. [2021-01-06 19:37:00,095 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 875 transitions. Word has length 67 [2021-01-06 19:37:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:00,095 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 875 transitions. [2021-01-06 19:37:00,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 875 transitions. [2021-01-06 19:37:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:37:00,098 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:00,098 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] [2021-01-06 19:37:00,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:37:00,099 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash 221435787, now seen corresponding path program 1 times [2021-01-06 19:37:00,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:00,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700960382] [2021-01-06 19:37:00,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:00,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700960382] [2021-01-06 19:37:00,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:00,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:00,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860510262] [2021-01-06 19:37:00,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:00,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:00,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:00,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:00,246 INFO L87 Difference]: Start difference. First operand 545 states and 875 transitions. Second operand 3 states. [2021-01-06 19:37:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:00,303 INFO L93 Difference]: Finished difference Result 1434 states and 2326 transitions. [2021-01-06 19:37:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:00,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:37:00,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:00,311 INFO L225 Difference]: With dead ends: 1434 [2021-01-06 19:37:00,311 INFO L226 Difference]: Without dead ends: 958 [2021-01-06 19:37:00,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-01-06 19:37:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 956. [2021-01-06 19:37:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2021-01-06 19:37:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1532 transitions. [2021-01-06 19:37:00,359 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1532 transitions. Word has length 67 [2021-01-06 19:37:00,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:00,359 INFO L481 AbstractCegarLoop]: Abstraction has 956 states and 1532 transitions. [2021-01-06 19:37:00,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1532 transitions. [2021-01-06 19:37:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:37:00,361 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:00,362 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] [2021-01-06 19:37:00,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:37:00,362 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:00,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:00,363 INFO L82 PathProgramCache]: Analyzing trace with hash 664156592, now seen corresponding path program 1 times [2021-01-06 19:37:00,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:00,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582496763] [2021-01-06 19:37:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:00,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582496763] [2021-01-06 19:37:00,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:00,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:00,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873947594] [2021-01-06 19:37:00,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:00,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:00,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:00,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:00,442 INFO L87 Difference]: Start difference. First operand 956 states and 1532 transitions. Second operand 3 states. [2021-01-06 19:37:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:00,499 INFO L93 Difference]: Finished difference Result 1783 states and 2881 transitions. [2021-01-06 19:37:00,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:00,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 19:37:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:00,508 INFO L225 Difference]: With dead ends: 1783 [2021-01-06 19:37:00,508 INFO L226 Difference]: Without dead ends: 1307 [2021-01-06 19:37:00,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2021-01-06 19:37:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1305. [2021-01-06 19:37:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2021-01-06 19:37:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2086 transitions. [2021-01-06 19:37:00,570 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2086 transitions. Word has length 69 [2021-01-06 19:37:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:00,571 INFO L481 AbstractCegarLoop]: Abstraction has 1305 states and 2086 transitions. [2021-01-06 19:37:00,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2086 transitions. [2021-01-06 19:37:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:37:00,572 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:00,573 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] [2021-01-06 19:37:00,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:37:00,573 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:00,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1757720902, now seen corresponding path program 1 times [2021-01-06 19:37:00,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:00,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123745188] [2021-01-06 19:37:00,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:00,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123745188] [2021-01-06 19:37:00,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:00,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:37:00,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838079087] [2021-01-06 19:37:00,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:37:00,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:00,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:37:00,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:00,797 INFO L87 Difference]: Start difference. First operand 1305 states and 2086 transitions. Second operand 5 states. [2021-01-06 19:37:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:01,200 INFO L93 Difference]: Finished difference Result 6582 states and 10723 transitions. [2021-01-06 19:37:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:37:01,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2021-01-06 19:37:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:01,244 INFO L225 Difference]: With dead ends: 6582 [2021-01-06 19:37:01,244 INFO L226 Difference]: Without dead ends: 5356 [2021-01-06 19:37:01,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:37:01,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5356 states. [2021-01-06 19:37:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5356 to 2452. [2021-01-06 19:37:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2452 states. [2021-01-06 19:37:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3914 transitions. [2021-01-06 19:37:01,427 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3914 transitions. Word has length 69 [2021-01-06 19:37:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:01,427 INFO L481 AbstractCegarLoop]: Abstraction has 2452 states and 3914 transitions. [2021-01-06 19:37:01,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:37:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3914 transitions. [2021-01-06 19:37:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:37:01,428 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:01,429 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] [2021-01-06 19:37:01,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:37:01,429 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:01,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash -577605759, now seen corresponding path program 1 times [2021-01-06 19:37:01,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:01,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280607859] [2021-01-06 19:37:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:01,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280607859] [2021-01-06 19:37:01,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:01,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:01,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223143578] [2021-01-06 19:37:01,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:01,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:01,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:01,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:01,515 INFO L87 Difference]: Start difference. First operand 2452 states and 3914 transitions. Second operand 4 states. [2021-01-06 19:37:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:01,901 INFO L93 Difference]: Finished difference Result 7943 states and 12835 transitions. [2021-01-06 19:37:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:01,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-01-06 19:37:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:01,943 INFO L225 Difference]: With dead ends: 7943 [2021-01-06 19:37:01,944 INFO L226 Difference]: Without dead ends: 5570 [2021-01-06 19:37:01,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2021-01-06 19:37:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 3992. [2021-01-06 19:37:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3992 states. [2021-01-06 19:37:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 6384 transitions. [2021-01-06 19:37:02,177 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 6384 transitions. Word has length 70 [2021-01-06 19:37:02,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:02,177 INFO L481 AbstractCegarLoop]: Abstraction has 3992 states and 6384 transitions. [2021-01-06 19:37:02,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 6384 transitions. [2021-01-06 19:37:02,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:37:02,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:02,179 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] [2021-01-06 19:37:02,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:37:02,179 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:02,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1815229649, now seen corresponding path program 1 times [2021-01-06 19:37:02,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:02,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456028182] [2021-01-06 19:37:02,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:02,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456028182] [2021-01-06 19:37:02,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:02,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:02,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242518956] [2021-01-06 19:37:02,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:02,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:02,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:02,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:02,360 INFO L87 Difference]: Start difference. First operand 3992 states and 6384 transitions. Second operand 4 states. [2021-01-06 19:37:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:02,784 INFO L93 Difference]: Finished difference Result 13018 states and 20914 transitions. [2021-01-06 19:37:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:02,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 19:37:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:02,864 INFO L225 Difference]: With dead ends: 13018 [2021-01-06 19:37:02,865 INFO L226 Difference]: Without dead ends: 9105 [2021-01-06 19:37:02,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9105 states. [2021-01-06 19:37:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9105 to 6388. [2021-01-06 19:37:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6388 states. [2021-01-06 19:37:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6388 states to 6388 states and 10164 transitions. [2021-01-06 19:37:03,326 INFO L78 Accepts]: Start accepts. Automaton has 6388 states and 10164 transitions. Word has length 71 [2021-01-06 19:37:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:03,327 INFO L481 AbstractCegarLoop]: Abstraction has 6388 states and 10164 transitions. [2021-01-06 19:37:03,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6388 states and 10164 transitions. [2021-01-06 19:37:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:37:03,328 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:03,329 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] [2021-01-06 19:37:03,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:37:03,330 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1147279688, now seen corresponding path program 1 times [2021-01-06 19:37:03,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:03,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606040603] [2021-01-06 19:37:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:03,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606040603] [2021-01-06 19:37:03,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:03,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:03,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243932625] [2021-01-06 19:37:03,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:03,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:03,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:03,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:03,420 INFO L87 Difference]: Start difference. First operand 6388 states and 10164 transitions. Second operand 4 states. [2021-01-06 19:37:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:04,185 INFO L93 Difference]: Finished difference Result 20047 states and 32019 transitions. [2021-01-06 19:37:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:04,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:37:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:04,235 INFO L225 Difference]: With dead ends: 20047 [2021-01-06 19:37:04,236 INFO L226 Difference]: Without dead ends: 13738 [2021-01-06 19:37:04,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states. [2021-01-06 19:37:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 10020. [2021-01-06 19:37:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10020 states. [2021-01-06 19:37:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10020 states to 10020 states and 15856 transitions. [2021-01-06 19:37:04,959 INFO L78 Accepts]: Start accepts. Automaton has 10020 states and 15856 transitions. Word has length 72 [2021-01-06 19:37:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:04,959 INFO L481 AbstractCegarLoop]: Abstraction has 10020 states and 15856 transitions. [2021-01-06 19:37:04,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 10020 states and 15856 transitions. [2021-01-06 19:37:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:37:04,965 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:04,965 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] [2021-01-06 19:37:04,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:37:04,966 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash -856706640, now seen corresponding path program 1 times [2021-01-06 19:37:04,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:04,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182888342] [2021-01-06 19:37:04,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:05,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182888342] [2021-01-06 19:37:05,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:05,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:05,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626993333] [2021-01-06 19:37:05,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:05,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:05,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:05,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:05,172 INFO L87 Difference]: Start difference. First operand 10020 states and 15856 transitions. Second operand 4 states. [2021-01-06 19:37:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:06,232 INFO L93 Difference]: Finished difference Result 29688 states and 46962 transitions. [2021-01-06 19:37:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:06,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 19:37:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:06,296 INFO L225 Difference]: With dead ends: 29688 [2021-01-06 19:37:06,297 INFO L226 Difference]: Without dead ends: 19677 [2021-01-06 19:37:06,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19677 states. [2021-01-06 19:37:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19677 to 19675. [2021-01-06 19:37:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19675 states. [2021-01-06 19:37:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19675 states to 19675 states and 30894 transitions. [2021-01-06 19:37:07,645 INFO L78 Accepts]: Start accepts. Automaton has 19675 states and 30894 transitions. Word has length 74 [2021-01-06 19:37:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:07,648 INFO L481 AbstractCegarLoop]: Abstraction has 19675 states and 30894 transitions. [2021-01-06 19:37:07,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 19675 states and 30894 transitions. [2021-01-06 19:37:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:37:07,651 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:07,652 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] [2021-01-06 19:37:07,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:37:07,653 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:07,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:07,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1857988380, now seen corresponding path program 1 times [2021-01-06 19:37:07,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:07,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297155363] [2021-01-06 19:37:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:07,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297155363] [2021-01-06 19:37:07,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:07,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:07,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92571252] [2021-01-06 19:37:07,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:07,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:07,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:07,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:07,725 INFO L87 Difference]: Start difference. First operand 19675 states and 30894 transitions. Second operand 3 states. [2021-01-06 19:37:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:09,548 INFO L93 Difference]: Finished difference Result 58987 states and 92620 transitions. [2021-01-06 19:37:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:09,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 19:37:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:09,733 INFO L225 Difference]: With dead ends: 58987 [2021-01-06 19:37:09,733 INFO L226 Difference]: Without dead ends: 39340 [2021-01-06 19:37:09,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39340 states. [2021-01-06 19:37:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39340 to 19677. [2021-01-06 19:37:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19677 states. [2021-01-06 19:37:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19677 states to 19677 states and 30896 transitions. [2021-01-06 19:37:11,631 INFO L78 Accepts]: Start accepts. Automaton has 19677 states and 30896 transitions. Word has length 75 [2021-01-06 19:37:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:11,631 INFO L481 AbstractCegarLoop]: Abstraction has 19677 states and 30896 transitions. [2021-01-06 19:37:11,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 19677 states and 30896 transitions. [2021-01-06 19:37:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:37:11,633 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:11,633 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] [2021-01-06 19:37:11,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:37:11,634 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:11,635 INFO L82 PathProgramCache]: Analyzing trace with hash 424514133, now seen corresponding path program 1 times [2021-01-06 19:37:11,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:11,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744387633] [2021-01-06 19:37:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:11,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744387633] [2021-01-06 19:37:11,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:11,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:11,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449457596] [2021-01-06 19:37:11,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:11,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:11,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:11,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:11,836 INFO L87 Difference]: Start difference. First operand 19677 states and 30896 transitions. Second operand 4 states. [2021-01-06 19:37:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:13,140 INFO L93 Difference]: Finished difference Result 58291 states and 91488 transitions. [2021-01-06 19:37:13,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:13,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:37:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:13,242 INFO L225 Difference]: With dead ends: 58291 [2021-01-06 19:37:13,243 INFO L226 Difference]: Without dead ends: 38626 [2021-01-06 19:37:13,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38626 states. [2021-01-06 19:37:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38626 to 38624. [2021-01-06 19:37:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38624 states. [2021-01-06 19:37:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38624 states to 38624 states and 60157 transitions. [2021-01-06 19:37:15,598 INFO L78 Accepts]: Start accepts. Automaton has 38624 states and 60157 transitions. Word has length 76 [2021-01-06 19:37:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:15,599 INFO L481 AbstractCegarLoop]: Abstraction has 38624 states and 60157 transitions. [2021-01-06 19:37:15,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 38624 states and 60157 transitions. [2021-01-06 19:37:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:37:15,600 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:15,601 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] [2021-01-06 19:37:15,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:37:15,601 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:15,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:15,602 INFO L82 PathProgramCache]: Analyzing trace with hash 551656516, now seen corresponding path program 1 times [2021-01-06 19:37:15,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:15,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883838890] [2021-01-06 19:37:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:15,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883838890] [2021-01-06 19:37:15,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:15,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:15,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270016182] [2021-01-06 19:37:15,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:15,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:15,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:15,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:15,698 INFO L87 Difference]: Start difference. First operand 38624 states and 60157 transitions. Second operand 4 states. [2021-01-06 19:37:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:18,171 INFO L93 Difference]: Finished difference Result 114364 states and 178019 transitions. [2021-01-06 19:37:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:18,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:37:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:18,345 INFO L225 Difference]: With dead ends: 114364 [2021-01-06 19:37:18,346 INFO L226 Difference]: Without dead ends: 75786 [2021-01-06 19:37:18,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2021-01-06 19:37:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 75784. [2021-01-06 19:37:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75784 states. [2021-01-06 19:37:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75784 states to 75784 states and 117031 transitions. [2021-01-06 19:37:22,098 INFO L78 Accepts]: Start accepts. Automaton has 75784 states and 117031 transitions. Word has length 76 [2021-01-06 19:37:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:22,098 INFO L481 AbstractCegarLoop]: Abstraction has 75784 states and 117031 transitions. [2021-01-06 19:37:22,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 75784 states and 117031 transitions. [2021-01-06 19:37:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:37:22,101 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:22,102 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] [2021-01-06 19:37:22,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:37:22,102 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash -656359944, now seen corresponding path program 1 times [2021-01-06 19:37:22,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:22,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188963695] [2021-01-06 19:37:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:22,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188963695] [2021-01-06 19:37:22,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:22,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:22,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747352398] [2021-01-06 19:37:22,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:22,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:22,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:22,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:22,140 INFO L87 Difference]: Start difference. First operand 75784 states and 117031 transitions. Second operand 3 states. [2021-01-06 19:37:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:27,305 INFO L93 Difference]: Finished difference Result 227228 states and 350901 transitions. [2021-01-06 19:37:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:27,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 19:37:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:27,590 INFO L225 Difference]: With dead ends: 227228 [2021-01-06 19:37:27,590 INFO L226 Difference]: Without dead ends: 151518 [2021-01-06 19:37:27,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151518 states. [2021-01-06 19:37:32,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151518 to 75792. [2021-01-06 19:37:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75792 states. [2021-01-06 19:37:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75792 states to 75792 states and 117039 transitions. [2021-01-06 19:37:32,301 INFO L78 Accepts]: Start accepts. Automaton has 75792 states and 117039 transitions. Word has length 77 [2021-01-06 19:37:32,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:32,301 INFO L481 AbstractCegarLoop]: Abstraction has 75792 states and 117039 transitions. [2021-01-06 19:37:32,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 75792 states and 117039 transitions. [2021-01-06 19:37:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:37:32,304 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:32,304 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] [2021-01-06 19:37:32,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:37:32,304 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:32,305 INFO L82 PathProgramCache]: Analyzing trace with hash 834408617, now seen corresponding path program 1 times [2021-01-06 19:37:32,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:32,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005471901] [2021-01-06 19:37:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:32,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005471901] [2021-01-06 19:37:32,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:32,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:32,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717739110] [2021-01-06 19:37:32,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:32,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:32,398 INFO L87 Difference]: Start difference. First operand 75792 states and 117039 transitions. Second operand 4 states. [2021-01-06 19:37:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:38,836 INFO L93 Difference]: Finished difference Result 224404 states and 346298 transitions. [2021-01-06 19:37:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:38,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 19:37:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:39,121 INFO L225 Difference]: With dead ends: 224404 [2021-01-06 19:37:39,121 INFO L226 Difference]: Without dead ends: 148667 [2021-01-06 19:37:39,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148667 states. [2021-01-06 19:37:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148667 to 148665. [2021-01-06 19:37:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148665 states. [2021-01-06 19:37:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148665 states to 148665 states and 227541 transitions. [2021-01-06 19:37:46,038 INFO L78 Accepts]: Start accepts. Automaton has 148665 states and 227541 transitions. Word has length 78 [2021-01-06 19:37:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:46,038 INFO L481 AbstractCegarLoop]: Abstraction has 148665 states and 227541 transitions. [2021-01-06 19:37:46,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 148665 states and 227541 transitions. [2021-01-06 19:37:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:37:46,043 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:46,043 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] [2021-01-06 19:37:46,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:37:46,043 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash 640680152, now seen corresponding path program 1 times [2021-01-06 19:37:46,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:46,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819453922] [2021-01-06 19:37:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:46,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819453922] [2021-01-06 19:37:46,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:46,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:46,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836134112] [2021-01-06 19:37:46,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:46,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:46,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:46,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:46,167 INFO L87 Difference]: Start difference. First operand 148665 states and 227541 transitions. Second operand 4 states. [2021-01-06 19:37:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:58,581 INFO L93 Difference]: Finished difference Result 440021 states and 672927 transitions. [2021-01-06 19:37:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:58,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 19:37:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:59,231 INFO L225 Difference]: With dead ends: 440021 [2021-01-06 19:37:59,232 INFO L226 Difference]: Without dead ends: 291515 [2021-01-06 19:37:59,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291515 states. [2021-01-06 19:38:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291515 to 291513. [2021-01-06 19:38:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291513 states. [2021-01-06 19:38:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291513 states to 291513 states and 442037 transitions. [2021-01-06 19:38:14,203 INFO L78 Accepts]: Start accepts. Automaton has 291513 states and 442037 transitions. Word has length 78 [2021-01-06 19:38:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:38:14,204 INFO L481 AbstractCegarLoop]: Abstraction has 291513 states and 442037 transitions. [2021-01-06 19:38:14,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:38:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 291513 states and 442037 transitions. [2021-01-06 19:38:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:38:14,210 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:38:14,210 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] [2021-01-06 19:38:14,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:38:14,224 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:38:14,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:38:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1890599668, now seen corresponding path program 1 times [2021-01-06 19:38:14,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:38:14,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270534148] [2021-01-06 19:38:14,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:38:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:38:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:38:14,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270534148] [2021-01-06 19:38:14,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:38:14,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:38:14,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842801875] [2021-01-06 19:38:14,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:38:14,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:38:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:38:14,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:38:14,277 INFO L87 Difference]: Start difference. First operand 291513 states and 442037 transitions. Second operand 3 states. [2021-01-06 19:38:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:38:38,507 INFO L93 Difference]: Finished difference Result 873245 states and 1324519 transitions. [2021-01-06 19:38:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:38:38,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-06 19:38:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:38:39,875 INFO L225 Difference]: With dead ends: 873245 [2021-01-06 19:38:39,875 INFO L226 Difference]: Without dead ends: 582795 [2021-01-06 19:38:40,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:38:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582795 states. [2021-01-06 19:38:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582795 to 291545. [2021-01-06 19:38:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291545 states. [2021-01-06 19:38:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291545 states to 291545 states and 442069 transitions. [2021-01-06 19:38:59,360 INFO L78 Accepts]: Start accepts. Automaton has 291545 states and 442069 transitions. Word has length 79 [2021-01-06 19:38:59,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:38:59,361 INFO L481 AbstractCegarLoop]: Abstraction has 291545 states and 442069 transitions. [2021-01-06 19:38:59,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:38:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 291545 states and 442069 transitions. [2021-01-06 19:38:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:38:59,367 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:38:59,367 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] [2021-01-06 19:38:59,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:38:59,367 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:38:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:38:59,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1453451011, now seen corresponding path program 1 times [2021-01-06 19:38:59,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:38:59,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905667351] [2021-01-06 19:38:59,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:38:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:38:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:38:59,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905667351] [2021-01-06 19:38:59,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:38:59,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:38:59,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132603217] [2021-01-06 19:38:59,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:38:59,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:38:59,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:38:59,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:38:59,502 INFO L87 Difference]: Start difference. First operand 291545 states and 442069 transitions. Second operand 4 states. [2021-01-06 19:39:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:39:29,960 INFO L93 Difference]: Finished difference Result 862768 states and 1306995 transitions. [2021-01-06 19:39:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:39:29,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 19:39:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:39:31,325 INFO L225 Difference]: With dead ends: 862768 [2021-01-06 19:39:31,326 INFO L226 Difference]: Without dead ends: 571474 [2021-01-06 19:39:31,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:39:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571474 states. [2021-01-06 19:40:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571474 to 571472. [2021-01-06 19:40:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571472 states. [2021-01-06 19:40:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571472 states to 571472 states and 858117 transitions. [2021-01-06 19:40:08,979 INFO L78 Accepts]: Start accepts. Automaton has 571472 states and 858117 transitions. Word has length 80 [2021-01-06 19:40:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:40:08,979 INFO L481 AbstractCegarLoop]: Abstraction has 571472 states and 858117 transitions. [2021-01-06 19:40:08,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:40:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 571472 states and 858117 transitions. [2021-01-06 19:40:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:40:09,010 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:40:09,011 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] [2021-01-06 19:40:09,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:40:09,011 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:40:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:40:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash -194781332, now seen corresponding path program 1 times [2021-01-06 19:40:09,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:40:09,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200499077] [2021-01-06 19:40:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:40:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:40:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:40:09,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200499077] [2021-01-06 19:40:09,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:40:09,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:40:09,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790531080] [2021-01-06 19:40:09,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:40:09,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:40:09,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:40:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:40:09,121 INFO L87 Difference]: Start difference. First operand 571472 states and 858117 transitions. Second operand 4 states.