/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_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:56:44,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:56:44,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:56:44,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:56:44,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:56:44,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:56:44,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:56:44,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:56:44,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:56:44,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:56:44,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:56:44,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:56:44,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:56:44,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:56:44,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:56:44,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:56:44,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:56:44,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:56:44,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:56:44,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:56:44,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:56:44,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:56:44,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:56:44,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:56:44,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:56:44,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:56:44,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:56:44,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:56:44,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:56:44,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:56:44,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:56:44,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:56:44,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:56:44,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:56:44,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:56:44,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:56:44,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:56:44,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:56:44,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:56:44,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:56:44,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:56:44,384 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:56:44,411 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:56:44,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:56:44,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:56:44,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:56:44,414 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:56:44,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:56:44,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:56:44,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:56:44,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:56:44,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:56:44,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:56:44,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:56:44,416 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:56:44,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:56:44,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:56:44,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:56:44,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:56:44,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:56:44,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:56:44,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:56:44,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:56:44,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:56:44,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:56:44,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:56:44,418 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:56:44,418 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:56:44,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:56:44,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:56:44,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:56:44,829 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:56:44,830 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:56:44,831 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-01-06 19:56:44,930 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8c990793a/6f8dfc1ec6ef4626a6e6b3c25d488950/FLAGf2a624c6f [2021-01-06 19:56:45,683 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:56:45,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-01-06 19:56:45,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8c990793a/6f8dfc1ec6ef4626a6e6b3c25d488950/FLAGf2a624c6f [2021-01-06 19:56:45,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8c990793a/6f8dfc1ec6ef4626a6e6b3c25d488950 [2021-01-06 19:56:45,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:56:45,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:56:46,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:56:46,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:56:46,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:56:46,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:56:45" (1/1) ... [2021-01-06 19:56:46,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649ae089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46, skipping insertion in model container [2021-01-06 19:56:46,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:56:45" (1/1) ... [2021-01-06 19:56:46,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:56:46,063 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] 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[~newmax~0,] 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[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~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[~newmax~1,] 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[~newmax~1,] 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[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~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[~newmax~2,] 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[~newmax~2,] 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[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~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___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[~newmax1~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[~newmax2~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[~newmax3~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:56:46,330 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_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2021-01-06 19:56:46,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:56:46,360 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] 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[~newmax~0,] 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[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~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[~newmax~1,] 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[~newmax~1,] 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[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~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[~newmax~2,] 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[~newmax~2,] 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[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~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___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[~newmax1~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[~newmax2~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[~newmax3~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:56:46,533 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_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2021-01-06 19:56:46,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:56:46,555 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:56:46,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46 WrapperNode [2021-01-06 19:56:46,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:56:46,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:56:46,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:56:46,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:56:46,569 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:56:46" (1/1) ... [2021-01-06 19:56:46,585 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:56:46" (1/1) ... [2021-01-06 19:56:46,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:56:46,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:56:46,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:56:46,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:56:46,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46" (1/1) ... [2021-01-06 19:56:46,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46" (1/1) ... [2021-01-06 19:56:46,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46" (1/1) ... [2021-01-06 19:56:46,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46" (1/1) ... [2021-01-06 19:56:46,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46" (1/1) ... [2021-01-06 19:56:46,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46" (1/1) ... [2021-01-06 19:56:46,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46" (1/1) ... [2021-01-06 19:56:46,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:56:46,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:56:46,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:56:46,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:56:46,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46" (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:56:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:56:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:56:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:56:46,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:56:48,024 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:56:48,024 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-01-06 19:56:48,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:56:48 BoogieIcfgContainer [2021-01-06 19:56:48,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:56:48,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:56:48,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:56:48,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:56:48,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:56:45" (1/3) ... [2021-01-06 19:56:48,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ddb2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:56:48, skipping insertion in model container [2021-01-06 19:56:48,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:46" (2/3) ... [2021-01-06 19:56:48,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ddb2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:56:48, skipping insertion in model container [2021-01-06 19:56:48,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:56:48" (3/3) ... [2021-01-06 19:56:48,042 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-01-06 19:56:48,048 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:56:48,055 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:56:48,073 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:56:48,102 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:56:48,102 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:56:48,103 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:56:48,103 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:56:48,103 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:56:48,103 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:56:48,103 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:56:48,103 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:56:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2021-01-06 19:56:48,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:56:48,132 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:48,133 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:56:48,133 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:48,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:48,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1418405445, now seen corresponding path program 1 times [2021-01-06 19:56:48,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:48,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050142592] [2021-01-06 19:56:48,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:48,568 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:56:48,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050142592] [2021-01-06 19:56:48,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:48,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:56:48,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019200053] [2021-01-06 19:56:48,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:56:48,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:48,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:56:48,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:56:48,595 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 2 states. [2021-01-06 19:56:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:48,630 INFO L93 Difference]: Finished difference Result 227 states and 388 transitions. [2021-01-06 19:56:48,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:56:48,632 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2021-01-06 19:56:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:48,645 INFO L225 Difference]: With dead ends: 227 [2021-01-06 19:56:48,646 INFO L226 Difference]: Without dead ends: 139 [2021-01-06 19:56:48,649 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:56:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-01-06 19:56:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-01-06 19:56:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2021-01-06 19:56:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 241 transitions. [2021-01-06 19:56:48,710 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 241 transitions. Word has length 37 [2021-01-06 19:56:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:48,711 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 241 transitions. [2021-01-06 19:56:48,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:56:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 241 transitions. [2021-01-06 19:56:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:56:48,714 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:48,714 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:56:48,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:56:48,715 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2058913401, now seen corresponding path program 1 times [2021-01-06 19:56:48,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:48,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795877892] [2021-01-06 19:56:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:48,851 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:56:48,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795877892] [2021-01-06 19:56:48,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:48,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:56:48,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794879578] [2021-01-06 19:56:48,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:56:48,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:48,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:56:48,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:48,857 INFO L87 Difference]: Start difference. First operand 139 states and 241 transitions. Second operand 5 states. [2021-01-06 19:56:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:49,086 INFO L93 Difference]: Finished difference Result 222 states and 378 transitions. [2021-01-06 19:56:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:56:49,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:56:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:49,093 INFO L225 Difference]: With dead ends: 222 [2021-01-06 19:56:49,093 INFO L226 Difference]: Without dead ends: 139 [2021-01-06 19:56:49,097 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:56:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-01-06 19:56:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-01-06 19:56:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2021-01-06 19:56:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2021-01-06 19:56:49,129 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 37 [2021-01-06 19:56:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:49,129 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2021-01-06 19:56:49,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:56:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2021-01-06 19:56:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:56:49,133 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:49,133 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] [2021-01-06 19:56:49,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:56:49,135 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:49,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:49,135 INFO L82 PathProgramCache]: Analyzing trace with hash -415118785, now seen corresponding path program 1 times [2021-01-06 19:56:49,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:49,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087897298] [2021-01-06 19:56:49,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:49,377 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:56:49,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087897298] [2021-01-06 19:56:49,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:49,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:49,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009780788] [2021-01-06 19:56:49,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:49,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:49,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:49,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:49,388 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand 3 states. [2021-01-06 19:56:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:49,475 INFO L93 Difference]: Finished difference Result 279 states and 445 transitions. [2021-01-06 19:56:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:49,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 19:56:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:49,479 INFO L225 Difference]: With dead ends: 279 [2021-01-06 19:56:49,479 INFO L226 Difference]: Without dead ends: 200 [2021-01-06 19:56:49,480 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:56:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-01-06 19:56:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2021-01-06 19:56:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-01-06 19:56:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2021-01-06 19:56:49,494 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 66 [2021-01-06 19:56:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:49,494 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2021-01-06 19:56:49,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2021-01-06 19:56:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 19:56:49,497 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:49,498 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] [2021-01-06 19:56:49,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:56:49,499 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:49,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:49,499 INFO L82 PathProgramCache]: Analyzing trace with hash 928134868, now seen corresponding path program 1 times [2021-01-06 19:56:49,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:49,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680524253] [2021-01-06 19:56:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:49,584 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:56:49,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680524253] [2021-01-06 19:56:49,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:49,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:49,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175109979] [2021-01-06 19:56:49,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:49,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:49,589 INFO L87 Difference]: Start difference. First operand 198 states and 306 transitions. Second operand 3 states. [2021-01-06 19:56:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:49,640 INFO L93 Difference]: Finished difference Result 458 states and 734 transitions. [2021-01-06 19:56:49,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:49,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 19:56:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:49,648 INFO L225 Difference]: With dead ends: 458 [2021-01-06 19:56:49,648 INFO L226 Difference]: Without dead ends: 320 [2021-01-06 19:56:49,653 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:56:49,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-01-06 19:56:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2021-01-06 19:56:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2021-01-06 19:56:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 503 transitions. [2021-01-06 19:56:49,699 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 503 transitions. Word has length 68 [2021-01-06 19:56:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:49,700 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 503 transitions. [2021-01-06 19:56:49,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 503 transitions. [2021-01-06 19:56:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:56:49,706 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:49,707 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:56:49,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:56:49,707 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1295175881, now seen corresponding path program 1 times [2021-01-06 19:56:49,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:49,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123431632] [2021-01-06 19:56:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:49,861 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:56:49,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123431632] [2021-01-06 19:56:49,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:49,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:49,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154801236] [2021-01-06 19:56:49,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:49,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:49,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:49,866 INFO L87 Difference]: Start difference. First operand 318 states and 503 transitions. Second operand 3 states. [2021-01-06 19:56:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:49,921 INFO L93 Difference]: Finished difference Result 802 states and 1297 transitions. [2021-01-06 19:56:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:49,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 19:56:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:49,928 INFO L225 Difference]: With dead ends: 802 [2021-01-06 19:56:49,928 INFO L226 Difference]: Without dead ends: 544 [2021-01-06 19:56:49,929 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:56:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-01-06 19:56:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 542. [2021-01-06 19:56:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2021-01-06 19:56:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 867 transitions. [2021-01-06 19:56:49,965 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 867 transitions. Word has length 70 [2021-01-06 19:56:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:49,965 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 867 transitions. [2021-01-06 19:56:49,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 867 transitions. [2021-01-06 19:56:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:56:49,967 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:49,967 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:56:49,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:56:49,967 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:49,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash -367652834, now seen corresponding path program 1 times [2021-01-06 19:56:49,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:49,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773022193] [2021-01-06 19:56:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:50,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773022193] [2021-01-06 19:56:50,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:50,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:56:50,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122004315] [2021-01-06 19:56:50,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:56:50,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:56:50,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:50,188 INFO L87 Difference]: Start difference. First operand 542 states and 867 transitions. Second operand 5 states. [2021-01-06 19:56:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:50,472 INFO L93 Difference]: Finished difference Result 2472 states and 4044 transitions. [2021-01-06 19:56:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:56:50,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:56:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:50,485 INFO L225 Difference]: With dead ends: 2472 [2021-01-06 19:56:50,485 INFO L226 Difference]: Without dead ends: 1990 [2021-01-06 19:56:50,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:56:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2021-01-06 19:56:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1006. [2021-01-06 19:56:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2021-01-06 19:56:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1623 transitions. [2021-01-06 19:56:50,532 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1623 transitions. Word has length 72 [2021-01-06 19:56:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:50,532 INFO L481 AbstractCegarLoop]: Abstraction has 1006 states and 1623 transitions. [2021-01-06 19:56:50,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:56:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1623 transitions. [2021-01-06 19:56:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 19:56:50,534 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:50,535 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] [2021-01-06 19:56:50,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:56:50,535 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash -435168554, now seen corresponding path program 1 times [2021-01-06 19:56:50,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:50,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248422299] [2021-01-06 19:56:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:50,608 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:56:50,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248422299] [2021-01-06 19:56:50,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:50,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:50,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775536892] [2021-01-06 19:56:50,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:50,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:50,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:50,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:50,611 INFO L87 Difference]: Start difference. First operand 1006 states and 1623 transitions. Second operand 4 states. [2021-01-06 19:56:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:50,829 INFO L93 Difference]: Finished difference Result 3644 states and 5934 transitions. [2021-01-06 19:56:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:50,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 19:56:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:50,843 INFO L225 Difference]: With dead ends: 3644 [2021-01-06 19:56:50,844 INFO L226 Difference]: Without dead ends: 2698 [2021-01-06 19:56:50,846 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:56:50,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2021-01-06 19:56:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 1843. [2021-01-06 19:56:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2021-01-06 19:56:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2977 transitions. [2021-01-06 19:56:50,922 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2977 transitions. Word has length 73 [2021-01-06 19:56:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:50,922 INFO L481 AbstractCegarLoop]: Abstraction has 1843 states and 2977 transitions. [2021-01-06 19:56:50,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2977 transitions. [2021-01-06 19:56:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:56:50,925 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:50,925 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:56:50,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:56:50,925 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:50,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash 152415701, now seen corresponding path program 1 times [2021-01-06 19:56:50,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:50,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811876963] [2021-01-06 19:56:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:50,981 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:56:50,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811876963] [2021-01-06 19:56:50,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:50,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:50,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411328241] [2021-01-06 19:56:50,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:50,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:50,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:50,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:50,984 INFO L87 Difference]: Start difference. First operand 1843 states and 2977 transitions. Second operand 3 states. [2021-01-06 19:56:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:51,086 INFO L93 Difference]: Finished difference Result 3597 states and 5826 transitions. [2021-01-06 19:56:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:51,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 19:56:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:51,100 INFO L225 Difference]: With dead ends: 3597 [2021-01-06 19:56:51,100 INFO L226 Difference]: Without dead ends: 2591 [2021-01-06 19:56:51,103 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:56:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2021-01-06 19:56:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2589. [2021-01-06 19:56:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2589 states. [2021-01-06 19:56:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4156 transitions. [2021-01-06 19:56:51,205 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4156 transitions. Word has length 74 [2021-01-06 19:56:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:51,205 INFO L481 AbstractCegarLoop]: Abstraction has 2589 states and 4156 transitions. [2021-01-06 19:56:51,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4156 transitions. [2021-01-06 19:56:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:56:51,207 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:51,207 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:56:51,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:56:51,208 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1935815765, now seen corresponding path program 1 times [2021-01-06 19:56:51,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:51,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807436138] [2021-01-06 19:56:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:51,296 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:56:51,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807436138] [2021-01-06 19:56:51,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:51,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:51,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19290295] [2021-01-06 19:56:51,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:51,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:51,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:51,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:51,299 INFO L87 Difference]: Start difference. First operand 2589 states and 4156 transitions. Second operand 4 states. [2021-01-06 19:56:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:51,560 INFO L93 Difference]: Finished difference Result 8144 states and 13137 transitions. [2021-01-06 19:56:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:51,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 19:56:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:51,590 INFO L225 Difference]: With dead ends: 8144 [2021-01-06 19:56:51,591 INFO L226 Difference]: Without dead ends: 5645 [2021-01-06 19:56:51,596 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:56:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5645 states. [2021-01-06 19:56:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5645 to 4101. [2021-01-06 19:56:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2021-01-06 19:56:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6558 transitions. [2021-01-06 19:56:51,821 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6558 transitions. Word has length 74 [2021-01-06 19:56:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:51,821 INFO L481 AbstractCegarLoop]: Abstraction has 4101 states and 6558 transitions. [2021-01-06 19:56:51,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6558 transitions. [2021-01-06 19:56:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:56:51,823 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:51,823 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:56:51,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:56:51,823 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:51,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:51,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2130170379, now seen corresponding path program 1 times [2021-01-06 19:56:51,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:51,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963440152] [2021-01-06 19:56:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:51,882 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:56:51,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963440152] [2021-01-06 19:56:51,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:51,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:51,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538187987] [2021-01-06 19:56:51,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:51,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:51,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:51,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:51,885 INFO L87 Difference]: Start difference. First operand 4101 states and 6558 transitions. Second operand 3 states. [2021-01-06 19:56:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:52,060 INFO L93 Difference]: Finished difference Result 8053 states and 12892 transitions. [2021-01-06 19:56:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:52,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 19:56:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:52,090 INFO L225 Difference]: With dead ends: 8053 [2021-01-06 19:56:52,090 INFO L226 Difference]: Without dead ends: 5741 [2021-01-06 19:56:52,095 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:56:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5741 states. [2021-01-06 19:56:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5741 to 5739. [2021-01-06 19:56:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5739 states. [2021-01-06 19:56:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 9098 transitions. [2021-01-06 19:56:52,383 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 9098 transitions. Word has length 74 [2021-01-06 19:56:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:52,384 INFO L481 AbstractCegarLoop]: Abstraction has 5739 states and 9098 transitions. [2021-01-06 19:56:52,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 9098 transitions. [2021-01-06 19:56:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:56:52,385 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:52,385 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:56:52,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:56:52,386 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:52,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:52,386 INFO L82 PathProgramCache]: Analyzing trace with hash 339461557, now seen corresponding path program 1 times [2021-01-06 19:56:52,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:52,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577923665] [2021-01-06 19:56:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:52,440 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:56:52,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577923665] [2021-01-06 19:56:52,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:52,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:52,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289437797] [2021-01-06 19:56:52,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:52,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:52,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:52,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:52,443 INFO L87 Difference]: Start difference. First operand 5739 states and 9098 transitions. Second operand 3 states. [2021-01-06 19:56:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:52,678 INFO L93 Difference]: Finished difference Result 13696 states and 21823 transitions. [2021-01-06 19:56:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:52,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 19:56:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:52,714 INFO L225 Difference]: With dead ends: 13696 [2021-01-06 19:56:52,714 INFO L226 Difference]: Without dead ends: 8043 [2021-01-06 19:56:52,724 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:56:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8043 states. [2021-01-06 19:56:53,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8043 to 8041. [2021-01-06 19:56:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8041 states. [2021-01-06 19:56:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8041 states to 8041 states and 12783 transitions. [2021-01-06 19:56:53,091 INFO L78 Accepts]: Start accepts. Automaton has 8041 states and 12783 transitions. Word has length 74 [2021-01-06 19:56:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:53,091 INFO L481 AbstractCegarLoop]: Abstraction has 8041 states and 12783 transitions. [2021-01-06 19:56:53,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 8041 states and 12783 transitions. [2021-01-06 19:56:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:56:53,092 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:53,092 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:56:53,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:56:53,092 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:53,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1704077331, now seen corresponding path program 1 times [2021-01-06 19:56:53,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:53,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081798470] [2021-01-06 19:56:53,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:53,239 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:56:53,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081798470] [2021-01-06 19:56:53,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:53,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:53,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283204258] [2021-01-06 19:56:53,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:53,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:53,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:53,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:53,242 INFO L87 Difference]: Start difference. First operand 8041 states and 12783 transitions. Second operand 4 states. [2021-01-06 19:56:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:53,844 INFO L93 Difference]: Finished difference Result 25448 states and 40536 transitions. [2021-01-06 19:56:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:53,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 19:56:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:53,886 INFO L225 Difference]: With dead ends: 25448 [2021-01-06 19:56:53,887 INFO L226 Difference]: Without dead ends: 17493 [2021-01-06 19:56:53,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:56:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17493 states. [2021-01-06 19:56:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17493 to 12714. [2021-01-06 19:56:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12714 states. [2021-01-06 19:56:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12714 states to 12714 states and 20070 transitions. [2021-01-06 19:56:54,537 INFO L78 Accepts]: Start accepts. Automaton has 12714 states and 20070 transitions. Word has length 75 [2021-01-06 19:56:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:54,537 INFO L481 AbstractCegarLoop]: Abstraction has 12714 states and 20070 transitions. [2021-01-06 19:56:54,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 12714 states and 20070 transitions. [2021-01-06 19:56:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:56:54,538 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:54,538 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:56:54,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:56:54,540 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:54,540 INFO L82 PathProgramCache]: Analyzing trace with hash 931672261, now seen corresponding path program 1 times [2021-01-06 19:56:54,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:54,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008764010] [2021-01-06 19:56:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:54,718 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:56:54,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008764010] [2021-01-06 19:56:54,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:54,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:54,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408234535] [2021-01-06 19:56:54,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:54,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:54,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:54,777 INFO L87 Difference]: Start difference. First operand 12714 states and 20070 transitions. Second operand 4 states. [2021-01-06 19:56:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:55,716 INFO L93 Difference]: Finished difference Result 37740 states and 59503 transitions. [2021-01-06 19:56:55,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:55,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-01-06 19:56:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:55,791 INFO L225 Difference]: With dead ends: 37740 [2021-01-06 19:56:55,791 INFO L226 Difference]: Without dead ends: 25035 [2021-01-06 19:56:55,809 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:56:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25035 states. [2021-01-06 19:56:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25035 to 25033. [2021-01-06 19:56:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25033 states. [2021-01-06 19:56:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25033 states to 25033 states and 39242 transitions. [2021-01-06 19:56:57,200 INFO L78 Accepts]: Start accepts. Automaton has 25033 states and 39242 transitions. Word has length 77 [2021-01-06 19:56:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:57,200 INFO L481 AbstractCegarLoop]: Abstraction has 25033 states and 39242 transitions. [2021-01-06 19:56:57,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 25033 states and 39242 transitions. [2021-01-06 19:56:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:56:57,202 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:57,202 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:56:57,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:56:57,203 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:57,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:57,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1466579386, now seen corresponding path program 1 times [2021-01-06 19:56:57,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:57,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805599380] [2021-01-06 19:56:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:57,375 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:56:57,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805599380] [2021-01-06 19:56:57,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:57,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:57,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235147675] [2021-01-06 19:56:57,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:57,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:57,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:57,378 INFO L87 Difference]: Start difference. First operand 25033 states and 39242 transitions. Second operand 3 states. [2021-01-06 19:56:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:58,701 INFO L93 Difference]: Finished difference Result 58583 states and 91632 transitions. [2021-01-06 19:56:58,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:58,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:56:58,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:58,814 INFO L225 Difference]: With dead ends: 58583 [2021-01-06 19:56:58,814 INFO L226 Difference]: Without dead ends: 33679 [2021-01-06 19:56:58,862 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:56:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33679 states. [2021-01-06 19:57:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33679 to 32767. [2021-01-06 19:57:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32767 states. [2021-01-06 19:57:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32767 states to 32767 states and 50640 transitions. [2021-01-06 19:57:00,397 INFO L78 Accepts]: Start accepts. Automaton has 32767 states and 50640 transitions. Word has length 78 [2021-01-06 19:57:00,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:00,397 INFO L481 AbstractCegarLoop]: Abstraction has 32767 states and 50640 transitions. [2021-01-06 19:57:00,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 32767 states and 50640 transitions. [2021-01-06 19:57:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:57:00,399 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:00,399 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:57:00,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:57:00,400 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:00,401 INFO L82 PathProgramCache]: Analyzing trace with hash 295226641, now seen corresponding path program 1 times [2021-01-06 19:57:00,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:00,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210105104] [2021-01-06 19:57:00,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:00,441 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:57:00,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210105104] [2021-01-06 19:57:00,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:00,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:00,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006000263] [2021-01-06 19:57:00,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:00,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:00,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:00,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:00,444 INFO L87 Difference]: Start difference. First operand 32767 states and 50640 transitions. Second operand 3 states. [2021-01-06 19:57:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:02,079 INFO L93 Difference]: Finished difference Result 98263 states and 151858 transitions. [2021-01-06 19:57:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:02,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:57:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:02,198 INFO L225 Difference]: With dead ends: 98263 [2021-01-06 19:57:02,198 INFO L226 Difference]: Without dead ends: 65524 [2021-01-06 19:57:02,241 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:57:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65524 states. [2021-01-06 19:57:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65524 to 32769. [2021-01-06 19:57:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32769 states. [2021-01-06 19:57:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32769 states to 32769 states and 50642 transitions. [2021-01-06 19:57:03,904 INFO L78 Accepts]: Start accepts. Automaton has 32769 states and 50642 transitions. Word has length 78 [2021-01-06 19:57:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:03,905 INFO L481 AbstractCegarLoop]: Abstraction has 32769 states and 50642 transitions. [2021-01-06 19:57:03,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 32769 states and 50642 transitions. [2021-01-06 19:57:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:57:03,906 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:03,906 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:57:03,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:57:03,906 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash -57061967, now seen corresponding path program 1 times [2021-01-06 19:57:03,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:03,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839368039] [2021-01-06 19:57:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:04,003 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:57:04,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839368039] [2021-01-06 19:57:04,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:04,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:57:04,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058386885] [2021-01-06 19:57:04,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:57:04,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:04,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:57:04,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:57:04,006 INFO L87 Difference]: Start difference. First operand 32769 states and 50642 transitions. Second operand 4 states. [2021-01-06 19:57:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:05,904 INFO L93 Difference]: Finished difference Result 96769 states and 149304 transitions. [2021-01-06 19:57:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:57:05,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-06 19:57:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:05,989 INFO L225 Difference]: With dead ends: 96769 [2021-01-06 19:57:05,989 INFO L226 Difference]: Without dead ends: 64030 [2021-01-06 19:57:06,017 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:57:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64030 states. [2021-01-06 19:57:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64030 to 64028. [2021-01-06 19:57:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64028 states. [2021-01-06 19:57:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64028 states to 64028 states and 98090 transitions. [2021-01-06 19:57:08,464 INFO L78 Accepts]: Start accepts. Automaton has 64028 states and 98090 transitions. Word has length 79 [2021-01-06 19:57:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:08,464 INFO L481 AbstractCegarLoop]: Abstraction has 64028 states and 98090 transitions. [2021-01-06 19:57:08,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:57:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 64028 states and 98090 transitions. [2021-01-06 19:57:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:57:08,466 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:57:08,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:57:08,467 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1163177193, now seen corresponding path program 1 times [2021-01-06 19:57:08,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:08,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887972866] [2021-01-06 19:57:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:08,516 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:57:08,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887972866] [2021-01-06 19:57:08,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:08,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:08,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104588125] [2021-01-06 19:57:08,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:08,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:08,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:08,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:08,519 INFO L87 Difference]: Start difference. First operand 64028 states and 98090 transitions. Second operand 3 states. [2021-01-06 19:57:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:11,360 INFO L93 Difference]: Finished difference Result 154916 states and 238318 transitions. [2021-01-06 19:57:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:11,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:57:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:11,512 INFO L225 Difference]: With dead ends: 154916 [2021-01-06 19:57:11,517 INFO L226 Difference]: Without dead ends: 91168 [2021-01-06 19:57:11,566 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:57:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91168 states. [2021-01-06 19:57:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91168 to 88502. [2021-01-06 19:57:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88502 states. [2021-01-06 19:57:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88502 states to 88502 states and 134830 transitions. [2021-01-06 19:57:15,061 INFO L78 Accepts]: Start accepts. Automaton has 88502 states and 134830 transitions. Word has length 80 [2021-01-06 19:57:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:15,061 INFO L481 AbstractCegarLoop]: Abstraction has 88502 states and 134830 transitions. [2021-01-06 19:57:15,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 88502 states and 134830 transitions. [2021-01-06 19:57:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:57:15,064 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:15,064 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:57:15,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:57:15,064 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:15,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:15,065 INFO L82 PathProgramCache]: Analyzing trace with hash -544448643, now seen corresponding path program 1 times [2021-01-06 19:57:15,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:15,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243247769] [2021-01-06 19:57:15,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:15,107 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:57:15,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243247769] [2021-01-06 19:57:15,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:15,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:15,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188833304] [2021-01-06 19:57:15,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:15,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:15,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:15,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:15,110 INFO L87 Difference]: Start difference. First operand 88502 states and 134830 transitions. Second operand 3 states. [2021-01-06 19:57:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:20,393 INFO L93 Difference]: Finished difference Result 265430 states and 404370 transitions. [2021-01-06 19:57:20,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:20,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:57:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:20,721 INFO L225 Difference]: With dead ends: 265430 [2021-01-06 19:57:20,721 INFO L226 Difference]: Without dead ends: 176972 [2021-01-06 19:57:20,788 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:57:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176972 states. [2021-01-06 19:57:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176972 to 88506. [2021-01-06 19:57:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88506 states. [2021-01-06 19:57:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88506 states to 88506 states and 134834 transitions. [2021-01-06 19:57:25,012 INFO L78 Accepts]: Start accepts. Automaton has 88506 states and 134834 transitions. Word has length 80 [2021-01-06 19:57:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:25,012 INFO L481 AbstractCegarLoop]: Abstraction has 88506 states and 134834 transitions. [2021-01-06 19:57:25,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 88506 states and 134834 transitions. [2021-01-06 19:57:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 19:57:25,013 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:25,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:57:25,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:57:25,014 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:25,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2051256477, now seen corresponding path program 1 times [2021-01-06 19:57:25,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:25,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690046408] [2021-01-06 19:57:25,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:25,111 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:57:25,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690046408] [2021-01-06 19:57:25,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:25,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:57:25,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21862751] [2021-01-06 19:57:25,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:57:25,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:25,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:57:25,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:57:25,114 INFO L87 Difference]: Start difference. First operand 88506 states and 134834 transitions. Second operand 4 states. [2021-01-06 19:57:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:30,697 INFO L93 Difference]: Finished difference Result 261266 states and 397258 transitions. [2021-01-06 19:57:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:57:30,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 19:57:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:31,032 INFO L225 Difference]: With dead ends: 261266 [2021-01-06 19:57:31,032 INFO L226 Difference]: Without dead ends: 172808 [2021-01-06 19:57:31,098 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:57:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172808 states. [2021-01-06 19:57:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172808 to 172806. [2021-01-06 19:57:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172806 states. [2021-01-06 19:57:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172806 states to 172806 states and 260760 transitions. [2021-01-06 19:57:38,143 INFO L78 Accepts]: Start accepts. Automaton has 172806 states and 260760 transitions. Word has length 81 [2021-01-06 19:57:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:38,143 INFO L481 AbstractCegarLoop]: Abstraction has 172806 states and 260760 transitions. [2021-01-06 19:57:38,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:57:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 172806 states and 260760 transitions. [2021-01-06 19:57:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:57:38,144 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:38,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:57:38,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:57:38,145 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:38,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:38,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2106822348, now seen corresponding path program 1 times [2021-01-06 19:57:38,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:38,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587127541] [2021-01-06 19:57:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:38,196 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:57:38,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587127541] [2021-01-06 19:57:38,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:38,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:38,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282739929] [2021-01-06 19:57:38,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:38,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:38,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:38,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:38,198 INFO L87 Difference]: Start difference. First operand 172806 states and 260760 transitions. Second operand 3 states. [2021-01-06 19:57:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:46,630 INFO L93 Difference]: Finished difference Result 418970 states and 635738 transitions. [2021-01-06 19:57:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:46,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 19:57:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:47,350 INFO L225 Difference]: With dead ends: 418970 [2021-01-06 19:57:47,351 INFO L226 Difference]: Without dead ends: 246728 [2021-01-06 19:57:47,460 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:57:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246728 states. [2021-01-06 19:57:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246728 to 238406. [2021-01-06 19:57:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238406 states. [2021-01-06 19:57:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238406 states to 238406 states and 357016 transitions. [2021-01-06 19:57:57,669 INFO L78 Accepts]: Start accepts. Automaton has 238406 states and 357016 transitions. Word has length 82 [2021-01-06 19:57:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:57,669 INFO L481 AbstractCegarLoop]: Abstraction has 238406 states and 357016 transitions. [2021-01-06 19:57:57,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 238406 states and 357016 transitions. [2021-01-06 19:57:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:57:57,672 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:57,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:57:57,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:57:57,672 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:57,673 INFO L82 PathProgramCache]: Analyzing trace with hash -565045271, now seen corresponding path program 1 times [2021-01-06 19:57:57,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:57,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045635679] [2021-01-06 19:57:57,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:57,708 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:57:57,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045635679] [2021-01-06 19:57:57,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:57,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:57,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189841934] [2021-01-06 19:57:57,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:57,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:57,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:57,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:57,710 INFO L87 Difference]: Start difference. First operand 238406 states and 357016 transitions. Second operand 3 states. [2021-01-06 19:58:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:13,958 INFO L93 Difference]: Finished difference Result 714794 states and 1070502 transitions. [2021-01-06 19:58:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:58:13,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 19:58:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:14,993 INFO L225 Difference]: With dead ends: 714794 [2021-01-06 19:58:14,994 INFO L226 Difference]: Without dead ends: 476720 [2021-01-06 19:58:15,238 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:58:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476720 states. [2021-01-06 19:58:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476720 to 238414. [2021-01-06 19:58:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238414 states. [2021-01-06 19:58:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238414 states to 238414 states and 357024 transitions. [2021-01-06 19:58:30,307 INFO L78 Accepts]: Start accepts. Automaton has 238414 states and 357024 transitions. Word has length 82 [2021-01-06 19:58:30,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:58:30,307 INFO L481 AbstractCegarLoop]: Abstraction has 238414 states and 357024 transitions. [2021-01-06 19:58:30,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:58:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 238414 states and 357024 transitions. [2021-01-06 19:58:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 19:58:30,310 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:58:30,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:58:30,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:58:30,312 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:58:30,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:58:30,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1283476260, now seen corresponding path program 1 times [2021-01-06 19:58:30,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:58:30,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049313543] [2021-01-06 19:58:30,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:58:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:58:30,529 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:58:30,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049313543] [2021-01-06 19:58:30,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:58:30,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:58:30,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285159845] [2021-01-06 19:58:30,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:58:30,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:58:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:58:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:58:30,536 INFO L87 Difference]: Start difference. First operand 238414 states and 357024 transitions. Second operand 5 states. [2021-01-06 19:58:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:49,312 INFO L93 Difference]: Finished difference Result 673280 states and 1007209 transitions. [2021-01-06 19:58:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:58:49,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2021-01-06 19:58:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:50,283 INFO L225 Difference]: With dead ends: 673280 [2021-01-06 19:58:50,284 INFO L226 Difference]: Without dead ends: 434954 [2021-01-06 19:58:50,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:58:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434954 states. [2021-01-06 19:59:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434954 to 434952. [2021-01-06 19:59:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434952 states. [2021-01-06 19:59:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434952 states to 434952 states and 644545 transitions. [2021-01-06 19:59:11,448 INFO L78 Accepts]: Start accepts. Automaton has 434952 states and 644545 transitions. Word has length 83 [2021-01-06 19:59:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:59:11,461 INFO L481 AbstractCegarLoop]: Abstraction has 434952 states and 644545 transitions. [2021-01-06 19:59:11,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:59:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 434952 states and 644545 transitions. [2021-01-06 19:59:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 19:59:11,464 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:59:11,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:59:11,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:59:11,465 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:59:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:59:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2141300343, now seen corresponding path program 1 times [2021-01-06 19:59:11,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:59:11,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328763434] [2021-01-06 19:59:11,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:59:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:59:12,358 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:59:12,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328763434] [2021-01-06 19:59:12,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:59:12,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:59:12,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069692776] [2021-01-06 19:59:12,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:59:12,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:59:12,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:59:12,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:59:12,364 INFO L87 Difference]: Start difference. First operand 434952 states and 644545 transitions. Second operand 4 states. [2021-01-06 19:59:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:59:29,743 INFO L93 Difference]: Finished difference Result 773142 states and 1143915 transitions. [2021-01-06 19:59:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:59:29,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2021-01-06 19:59:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:59:30,496 INFO L225 Difference]: With dead ends: 773142 [2021-01-06 19:59:30,496 INFO L226 Difference]: Without dead ends: 338264 [2021-01-06 19:59:30,816 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:59:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338264 states. [2021-01-06 19:59:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338264 to 338264. [2021-01-06 19:59:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338264 states. [2021-01-06 19:59:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338264 states to 338264 states and 499473 transitions. [2021-01-06 19:59:47,106 INFO L78 Accepts]: Start accepts. Automaton has 338264 states and 499473 transitions. Word has length 83 [2021-01-06 19:59:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:59:47,106 INFO L481 AbstractCegarLoop]: Abstraction has 338264 states and 499473 transitions. [2021-01-06 19:59:47,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:59:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 338264 states and 499473 transitions. [2021-01-06 19:59:47,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 19:59:47,109 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:59:47,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:59:47,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:59:47,110 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:59:47,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:59:47,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1610663161, now seen corresponding path program 1 times [2021-01-06 19:59:47,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:59:47,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472350190] [2021-01-06 19:59:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:59:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:59:47,269 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:59:47,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472350190] [2021-01-06 19:59:47,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:59:47,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:59:47,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837282274] [2021-01-06 19:59:47,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:59:47,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:59:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:59:47,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:59:47,275 INFO L87 Difference]: Start difference. First operand 338264 states and 499473 transitions. Second operand 4 states. [2021-01-06 20:00:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:00:11,363 INFO L93 Difference]: Finished difference Result 890224 states and 1313038 transitions. [2021-01-06 20:00:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:00:11,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-06 20:00:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:00:12,565 INFO L225 Difference]: With dead ends: 890224 [2021-01-06 20:00:12,566 INFO L226 Difference]: Without dead ends: 552092 [2021-01-06 20:00:13,136 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 20:00:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552092 states.