/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:54:46,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:54:46,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:54:46,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:54:46,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:54:46,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:54:46,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:54:46,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:54:46,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:54:46,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:54:46,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:54:46,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:54:46,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:54:46,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:54:46,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:54:46,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:54:46,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:54:46,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:54:46,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:54:46,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:54:46,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:54:46,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:54:46,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:54:46,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:54:47,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:54:47,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:54:47,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:54:47,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:54:47,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:54:47,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:54:47,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:54:47,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:54:47,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:54:47,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:54:47,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:54:47,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:54:47,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:54:47,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:54:47,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:54:47,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:54:47,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:54:47,036 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:54:47,088 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:54:47,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:54:47,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:54:47,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:54:47,092 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:54:47,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:54:47,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:54:47,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:54:47,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:54:47,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:54:47,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:54:47,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:54:47,096 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:54:47,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:54:47,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:54:47,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:54:47,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:54:47,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:54:47,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:54:47,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:54:47,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:54:47,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:54:47,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:54:47,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:54:47,099 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:54:47,099 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:54:47,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:54:47,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:54:47,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:54:47,525 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:54:47,526 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:54:47,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2021-01-06 19:54:47,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/be717286e/3ceed0a747c247de84f900aa9ffa9bf8/FLAG9653056e7 [2021-01-06 19:54:48,257 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:54:48,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2021-01-06 19:54:48,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/be717286e/3ceed0a747c247de84f900aa9ffa9bf8/FLAG9653056e7 [2021-01-06 19:54:48,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/be717286e/3ceed0a747c247de84f900aa9ffa9bf8 [2021-01-06 19:54:48,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:54:48,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:54:48,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:54:48,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:54:48,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:54:48,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:54:48" (1/1) ... [2021-01-06 19:54:48,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b860b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:48, skipping insertion in model container [2021-01-06 19:54:48,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:54:48" (1/1) ... [2021-01-06 19:54:48,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:54:48,672 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:54:48,990 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2021-01-06 19:54:48,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:54:49,008 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~m8~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:54:49,113 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2021-01-06 19:54:49,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:54:49,140 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:54:49,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:49 WrapperNode [2021-01-06 19:54:49,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:54:49,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:54:49,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:54:49,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:54:49,153 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:54:49" (1/1) ... [2021-01-06 19:54:49,169 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:54:49" (1/1) ... [2021-01-06 19:54:49,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:54:49,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:54:49,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:54:49,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:54:49,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:49" (1/1) ... [2021-01-06 19:54:49,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:49" (1/1) ... [2021-01-06 19:54:49,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:49" (1/1) ... [2021-01-06 19:54:49,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:49" (1/1) ... [2021-01-06 19:54:49,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:49" (1/1) ... [2021-01-06 19:54:49,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:49" (1/1) ... [2021-01-06 19:54:49,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:49" (1/1) ... [2021-01-06 19:54:49,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:54:49,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:54:49,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:54:49,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:54:49,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:49" (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:54:49,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:54:49,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:54:49,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:54:49,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:54:50,754 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:54:50,754 INFO L299 CfgBuilder]: Removed 29 assume(true) statements. [2021-01-06 19:54:50,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:54:50 BoogieIcfgContainer [2021-01-06 19:54:50,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:54:50,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:54:50,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:54:50,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:54:50,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:54:48" (1/3) ... [2021-01-06 19:54:50,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab8d7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:54:50, skipping insertion in model container [2021-01-06 19:54:50,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:54:49" (2/3) ... [2021-01-06 19:54:50,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab8d7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:54:50, skipping insertion in model container [2021-01-06 19:54:50,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:54:50" (3/3) ... [2021-01-06 19:54:50,771 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2021-01-06 19:54:50,778 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:54:50,784 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:54:50,804 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:54:50,834 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:54:50,835 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:54:50,835 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:54:50,835 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:54:50,835 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:54:50,835 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:54:50,835 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:54:50,836 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:54:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2021-01-06 19:54:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 19:54:50,870 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:50,871 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] [2021-01-06 19:54:50,871 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:50,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash -486996250, now seen corresponding path program 1 times [2021-01-06 19:54:50,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:50,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141369249] [2021-01-06 19:54:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:51,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141369249] [2021-01-06 19:54:51,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:51,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:54:51,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832725210] [2021-01-06 19:54:51,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:54:51,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:51,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:54:51,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:54:51,271 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 2 states. [2021-01-06 19:54:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:51,307 INFO L93 Difference]: Finished difference Result 222 states and 379 transitions. [2021-01-06 19:54:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:54:51,309 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2021-01-06 19:54:51,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:51,324 INFO L225 Difference]: With dead ends: 222 [2021-01-06 19:54:51,324 INFO L226 Difference]: Without dead ends: 142 [2021-01-06 19:54:51,328 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:54:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-01-06 19:54:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-01-06 19:54:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2021-01-06 19:54:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 248 transitions. [2021-01-06 19:54:51,418 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 248 transitions. Word has length 45 [2021-01-06 19:54:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:51,419 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 248 transitions. [2021-01-06 19:54:51,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:54:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 248 transitions. [2021-01-06 19:54:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 19:54:51,425 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:51,425 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] [2021-01-06 19:54:51,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:54:51,427 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1858803548, now seen corresponding path program 1 times [2021-01-06 19:54:51,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:51,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007928111] [2021-01-06 19:54:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:51,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007928111] [2021-01-06 19:54:51,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:51,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:54:51,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975259250] [2021-01-06 19:54:51,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:54:51,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:51,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:54:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:54:51,627 INFO L87 Difference]: Start difference. First operand 142 states and 248 transitions. Second operand 5 states. [2021-01-06 19:54:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:51,794 INFO L93 Difference]: Finished difference Result 221 states and 372 transitions. [2021-01-06 19:54:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:54:51,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2021-01-06 19:54:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:51,798 INFO L225 Difference]: With dead ends: 221 [2021-01-06 19:54:51,798 INFO L226 Difference]: Without dead ends: 142 [2021-01-06 19:54:51,799 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:54:51,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-01-06 19:54:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-01-06 19:54:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2021-01-06 19:54:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 187 transitions. [2021-01-06 19:54:51,814 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 187 transitions. Word has length 45 [2021-01-06 19:54:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:51,814 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 187 transitions. [2021-01-06 19:54:51,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:54:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 187 transitions. [2021-01-06 19:54:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:51,819 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:51,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:51,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:54:51,820 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:51,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1176555156, now seen corresponding path program 1 times [2021-01-06 19:54:51,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:51,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147720987] [2021-01-06 19:54:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:52,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147720987] [2021-01-06 19:54:52,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:52,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:52,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541230431] [2021-01-06 19:54:52,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:52,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:52,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:52,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:52,102 INFO L87 Difference]: Start difference. First operand 142 states and 187 transitions. Second operand 3 states. [2021-01-06 19:54:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:52,136 INFO L93 Difference]: Finished difference Result 286 states and 417 transitions. [2021-01-06 19:54:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:52,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:52,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:52,139 INFO L225 Difference]: With dead ends: 286 [2021-01-06 19:54:52,139 INFO L226 Difference]: Without dead ends: 211 [2021-01-06 19:54:52,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-01-06 19:54:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2021-01-06 19:54:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2021-01-06 19:54:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 295 transitions. [2021-01-06 19:54:52,158 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 295 transitions. Word has length 105 [2021-01-06 19:54:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:52,159 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 295 transitions. [2021-01-06 19:54:52,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 295 transitions. [2021-01-06 19:54:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:52,163 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:52,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:52,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:54:52,164 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:52,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1701405430, now seen corresponding path program 1 times [2021-01-06 19:54:52,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:52,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025791421] [2021-01-06 19:54:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:52,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025791421] [2021-01-06 19:54:52,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:52,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:52,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121807325] [2021-01-06 19:54:52,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:52,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:52,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:52,387 INFO L87 Difference]: Start difference. First operand 209 states and 295 transitions. Second operand 3 states. [2021-01-06 19:54:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:52,427 INFO L93 Difference]: Finished difference Result 481 states and 731 transitions. [2021-01-06 19:54:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:52,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:52,433 INFO L225 Difference]: With dead ends: 481 [2021-01-06 19:54:52,433 INFO L226 Difference]: Without dead ends: 339 [2021-01-06 19:54:52,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-01-06 19:54:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2021-01-06 19:54:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2021-01-06 19:54:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 500 transitions. [2021-01-06 19:54:52,464 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 500 transitions. Word has length 105 [2021-01-06 19:54:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:52,465 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 500 transitions. [2021-01-06 19:54:52,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 500 transitions. [2021-01-06 19:54:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:52,467 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:52,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:52,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:54:52,468 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash -179136962, now seen corresponding path program 1 times [2021-01-06 19:54:52,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:52,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605479284] [2021-01-06 19:54:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:52,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605479284] [2021-01-06 19:54:52,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:52,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:52,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857498328] [2021-01-06 19:54:52,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:52,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:52,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:52,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:52,581 INFO L87 Difference]: Start difference. First operand 337 states and 500 transitions. Second operand 3 states. [2021-01-06 19:54:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:52,622 INFO L93 Difference]: Finished difference Result 853 states and 1326 transitions. [2021-01-06 19:54:52,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:52,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:52,628 INFO L225 Difference]: With dead ends: 853 [2021-01-06 19:54:52,628 INFO L226 Difference]: Without dead ends: 583 [2021-01-06 19:54:52,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-01-06 19:54:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 581. [2021-01-06 19:54:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2021-01-06 19:54:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 888 transitions. [2021-01-06 19:54:52,661 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 888 transitions. Word has length 105 [2021-01-06 19:54:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:52,662 INFO L481 AbstractCegarLoop]: Abstraction has 581 states and 888 transitions. [2021-01-06 19:54:52,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 888 transitions. [2021-01-06 19:54:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:52,664 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:52,665 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:52,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:54:52,665 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:52,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1430042254, now seen corresponding path program 1 times [2021-01-06 19:54:52,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:52,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414874271] [2021-01-06 19:54:52,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:52,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414874271] [2021-01-06 19:54:52,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:52,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:52,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60434114] [2021-01-06 19:54:52,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:52,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:52,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:52,779 INFO L87 Difference]: Start difference. First operand 581 states and 888 transitions. Second operand 3 states. [2021-01-06 19:54:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:52,822 INFO L93 Difference]: Finished difference Result 1561 states and 2450 transitions. [2021-01-06 19:54:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:52,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:52,830 INFO L225 Difference]: With dead ends: 1561 [2021-01-06 19:54:52,830 INFO L226 Difference]: Without dead ends: 1047 [2021-01-06 19:54:52,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2021-01-06 19:54:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1045. [2021-01-06 19:54:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2021-01-06 19:54:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1620 transitions. [2021-01-06 19:54:52,873 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1620 transitions. Word has length 105 [2021-01-06 19:54:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:52,873 INFO L481 AbstractCegarLoop]: Abstraction has 1045 states and 1620 transitions. [2021-01-06 19:54:52,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1620 transitions. [2021-01-06 19:54:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:52,875 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:52,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:52,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:54:52,876 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:52,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2119342312, now seen corresponding path program 1 times [2021-01-06 19:54:52,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:52,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392650232] [2021-01-06 19:54:52,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:53,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392650232] [2021-01-06 19:54:53,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:53,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:53,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483748938] [2021-01-06 19:54:53,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:53,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:53,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:53,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:53,027 INFO L87 Difference]: Start difference. First operand 1045 states and 1620 transitions. Second operand 3 states. [2021-01-06 19:54:53,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:53,093 INFO L93 Difference]: Finished difference Result 2905 states and 4566 transitions. [2021-01-06 19:54:53,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:53,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:53,106 INFO L225 Difference]: With dead ends: 2905 [2021-01-06 19:54:53,106 INFO L226 Difference]: Without dead ends: 1927 [2021-01-06 19:54:53,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2021-01-06 19:54:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1925. [2021-01-06 19:54:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2021-01-06 19:54:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2996 transitions. [2021-01-06 19:54:53,183 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2996 transitions. Word has length 105 [2021-01-06 19:54:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:53,184 INFO L481 AbstractCegarLoop]: Abstraction has 1925 states and 2996 transitions. [2021-01-06 19:54:53,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2996 transitions. [2021-01-06 19:54:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:53,189 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:53,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:53,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:54:53,189 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash 179311454, now seen corresponding path program 1 times [2021-01-06 19:54:53,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:53,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533209565] [2021-01-06 19:54:53,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:53,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533209565] [2021-01-06 19:54:53,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:53,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:53,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532540551] [2021-01-06 19:54:53,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:53,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:53,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:53,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:53,308 INFO L87 Difference]: Start difference. First operand 1925 states and 2996 transitions. Second operand 3 states. [2021-01-06 19:54:53,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:53,451 INFO L93 Difference]: Finished difference Result 5449 states and 8534 transitions. [2021-01-06 19:54:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:53,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:54:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:53,471 INFO L225 Difference]: With dead ends: 5449 [2021-01-06 19:54:53,471 INFO L226 Difference]: Without dead ends: 3591 [2021-01-06 19:54:53,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2021-01-06 19:54:53,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3589. [2021-01-06 19:54:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3589 states. [2021-01-06 19:54:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5572 transitions. [2021-01-06 19:54:53,630 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5572 transitions. Word has length 105 [2021-01-06 19:54:53,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:53,630 INFO L481 AbstractCegarLoop]: Abstraction has 3589 states and 5572 transitions. [2021-01-06 19:54:53,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5572 transitions. [2021-01-06 19:54:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:53,633 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:53,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:53,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:54:53,634 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:53,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:53,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1414973228, now seen corresponding path program 1 times [2021-01-06 19:54:53,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:53,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733482068] [2021-01-06 19:54:53,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:53,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733482068] [2021-01-06 19:54:53,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:53,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:54:53,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016604715] [2021-01-06 19:54:53,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:54:53,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:53,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:54:53,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:54:53,820 INFO L87 Difference]: Start difference. First operand 3589 states and 5572 transitions. Second operand 6 states. [2021-01-06 19:54:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:54,345 INFO L93 Difference]: Finished difference Result 7111 states and 11077 transitions. [2021-01-06 19:54:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:54:54,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2021-01-06 19:54:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:54,368 INFO L225 Difference]: With dead ends: 7111 [2021-01-06 19:54:54,369 INFO L226 Difference]: Without dead ends: 3589 [2021-01-06 19:54:54,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2021-01-06 19:54:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3589. [2021-01-06 19:54:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3589 states. [2021-01-06 19:54:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5540 transitions. [2021-01-06 19:54:54,597 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5540 transitions. Word has length 105 [2021-01-06 19:54:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:54,597 INFO L481 AbstractCegarLoop]: Abstraction has 3589 states and 5540 transitions. [2021-01-06 19:54:54,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:54:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5540 transitions. [2021-01-06 19:54:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:54,598 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:54,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:54,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:54:54,599 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:54,600 INFO L82 PathProgramCache]: Analyzing trace with hash -905500138, now seen corresponding path program 1 times [2021-01-06 19:54:54,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:54,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555234101] [2021-01-06 19:54:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:54,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555234101] [2021-01-06 19:54:54,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:54,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:54:54,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060755203] [2021-01-06 19:54:54,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:54:54,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:54,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:54:54,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:54:54,781 INFO L87 Difference]: Start difference. First operand 3589 states and 5540 transitions. Second operand 6 states. [2021-01-06 19:54:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:55,173 INFO L93 Difference]: Finished difference Result 7111 states and 11013 transitions. [2021-01-06 19:54:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:54:55,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2021-01-06 19:54:55,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:55,192 INFO L225 Difference]: With dead ends: 7111 [2021-01-06 19:54:55,193 INFO L226 Difference]: Without dead ends: 3589 [2021-01-06 19:54:55,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2021-01-06 19:54:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3589. [2021-01-06 19:54:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3589 states. [2021-01-06 19:54:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5508 transitions. [2021-01-06 19:54:55,463 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5508 transitions. Word has length 105 [2021-01-06 19:54:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:55,463 INFO L481 AbstractCegarLoop]: Abstraction has 3589 states and 5508 transitions. [2021-01-06 19:54:55,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:54:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5508 transitions. [2021-01-06 19:54:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:54:55,465 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:55,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:55,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:54:55,465 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:55,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:55,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1180259752, now seen corresponding path program 1 times [2021-01-06 19:54:55,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:55,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605796413] [2021-01-06 19:54:55,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:55,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605796413] [2021-01-06 19:54:55,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:55,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:54:55,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809001716] [2021-01-06 19:54:55,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:54:55,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:55,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:54:55,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:54:55,670 INFO L87 Difference]: Start difference. First operand 3589 states and 5508 transitions. Second operand 10 states. [2021-01-06 19:54:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:59,256 INFO L93 Difference]: Finished difference Result 59941 states and 92564 transitions. [2021-01-06 19:54:59,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 19:54:59,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2021-01-06 19:54:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:59,443 INFO L225 Difference]: With dead ends: 59941 [2021-01-06 19:54:59,444 INFO L226 Difference]: Without dead ends: 56419 [2021-01-06 19:54:59,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2021-01-06 19:54:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56419 states. [2021-01-06 19:55:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56419 to 7109. [2021-01-06 19:55:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2021-01-06 19:55:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 10820 transitions. [2021-01-06 19:55:00,681 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 10820 transitions. Word has length 105 [2021-01-06 19:55:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:00,682 INFO L481 AbstractCegarLoop]: Abstraction has 7109 states and 10820 transitions. [2021-01-06 19:55:00,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:55:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 10820 transitions. [2021-01-06 19:55:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 19:55:00,683 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:00,684 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:00,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:55:00,685 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:00,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1773942360, now seen corresponding path program 1 times [2021-01-06 19:55:00,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:00,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090979446] [2021-01-06 19:55:00,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:00,794 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:55:00,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090979446] [2021-01-06 19:55:00,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:00,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:55:00,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061865860] [2021-01-06 19:55:00,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:55:00,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:00,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:55:00,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:55:00,797 INFO L87 Difference]: Start difference. First operand 7109 states and 10820 transitions. Second operand 3 states. [2021-01-06 19:55:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:01,581 INFO L93 Difference]: Finished difference Result 17515 states and 26696 transitions. [2021-01-06 19:55:01,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:55:01,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-06 19:55:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:01,623 INFO L225 Difference]: With dead ends: 17515 [2021-01-06 19:55:01,623 INFO L226 Difference]: Without dead ends: 10473 [2021-01-06 19:55:01,633 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:55:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10473 states. [2021-01-06 19:55:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10473 to 10471. [2021-01-06 19:55:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10471 states. [2021-01-06 19:55:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10471 states to 10471 states and 15846 transitions. [2021-01-06 19:55:02,676 INFO L78 Accepts]: Start accepts. Automaton has 10471 states and 15846 transitions. Word has length 107 [2021-01-06 19:55:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:02,676 INFO L481 AbstractCegarLoop]: Abstraction has 10471 states and 15846 transitions. [2021-01-06 19:55:02,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:55:02,676 INFO L276 IsEmpty]: Start isEmpty. Operand 10471 states and 15846 transitions. [2021-01-06 19:55:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 19:55:02,678 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:02,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:02,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:55:02,678 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:02,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:02,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1707448848, now seen corresponding path program 1 times [2021-01-06 19:55:02,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:02,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758259335] [2021-01-06 19:55:02,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:03,304 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:55:03,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758259335] [2021-01-06 19:55:03,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:03,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:55:03,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017383909] [2021-01-06 19:55:03,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:55:03,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:03,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:55:03,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:55:03,308 INFO L87 Difference]: Start difference. First operand 10471 states and 15846 transitions. Second operand 10 states. [2021-01-06 19:55:03,663 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-01-06 19:55:03,922 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-01-06 19:55:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:05,232 INFO L93 Difference]: Finished difference Result 26061 states and 39577 transitions. [2021-01-06 19:55:05,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:55:05,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2021-01-06 19:55:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:05,264 INFO L225 Difference]: With dead ends: 26061 [2021-01-06 19:55:05,265 INFO L226 Difference]: Without dead ends: 15659 [2021-01-06 19:55:05,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2021-01-06 19:55:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15659 states. [2021-01-06 19:55:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15659 to 10471. [2021-01-06 19:55:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10471 states. [2021-01-06 19:55:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10471 states to 10471 states and 15750 transitions. [2021-01-06 19:55:06,052 INFO L78 Accepts]: Start accepts. Automaton has 10471 states and 15750 transitions. Word has length 107 [2021-01-06 19:55:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:06,053 INFO L481 AbstractCegarLoop]: Abstraction has 10471 states and 15750 transitions. [2021-01-06 19:55:06,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:55:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 10471 states and 15750 transitions. [2021-01-06 19:55:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 19:55:06,054 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:06,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:06,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:55:06,055 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:06,055 INFO L82 PathProgramCache]: Analyzing trace with hash 81465228, now seen corresponding path program 1 times [2021-01-06 19:55:06,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:06,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840694461] [2021-01-06 19:55:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:06,142 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:55:06,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840694461] [2021-01-06 19:55:06,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:06,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:55:06,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137724799] [2021-01-06 19:55:06,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:55:06,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:06,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:55:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:55:06,144 INFO L87 Difference]: Start difference. First operand 10471 states and 15750 transitions. Second operand 3 states. [2021-01-06 19:55:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:07,795 INFO L93 Difference]: Finished difference Result 30123 states and 45192 transitions. [2021-01-06 19:55:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:55:07,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-06 19:55:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:07,839 INFO L225 Difference]: With dead ends: 30123 [2021-01-06 19:55:07,840 INFO L226 Difference]: Without dead ends: 19721 [2021-01-06 19:55:07,858 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:55:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19721 states. [2021-01-06 19:55:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19721 to 19719. [2021-01-06 19:55:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19719 states. [2021-01-06 19:55:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19719 states to 19719 states and 29318 transitions. [2021-01-06 19:55:09,488 INFO L78 Accepts]: Start accepts. Automaton has 19719 states and 29318 transitions. Word has length 107 [2021-01-06 19:55:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:09,489 INFO L481 AbstractCegarLoop]: Abstraction has 19719 states and 29318 transitions. [2021-01-06 19:55:09,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:55:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19719 states and 29318 transitions. [2021-01-06 19:55:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 19:55:09,490 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:09,490 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:09,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:55:09,490 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1328972844, now seen corresponding path program 1 times [2021-01-06 19:55:09,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:09,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561800622] [2021-01-06 19:55:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:09,572 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:55:09,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561800622] [2021-01-06 19:55:09,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:09,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:55:09,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739990059] [2021-01-06 19:55:09,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:55:09,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:09,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:55:09,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:55:09,575 INFO L87 Difference]: Start difference. First operand 19719 states and 29318 transitions. Second operand 3 states. [2021-01-06 19:55:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:12,064 INFO L93 Difference]: Finished difference Result 56715 states and 83976 transitions. [2021-01-06 19:55:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:55:12,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-06 19:55:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:12,107 INFO L225 Difference]: With dead ends: 56715 [2021-01-06 19:55:12,107 INFO L226 Difference]: Without dead ends: 37065 [2021-01-06 19:55:12,137 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:55:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37065 states. [2021-01-06 19:55:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37065 to 37063. [2021-01-06 19:55:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37063 states. [2021-01-06 19:55:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37063 states to 37063 states and 54342 transitions. [2021-01-06 19:55:15,272 INFO L78 Accepts]: Start accepts. Automaton has 37063 states and 54342 transitions. Word has length 107 [2021-01-06 19:55:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:15,272 INFO L481 AbstractCegarLoop]: Abstraction has 37063 states and 54342 transitions. [2021-01-06 19:55:15,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:55:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 37063 states and 54342 transitions. [2021-01-06 19:55:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 19:55:15,274 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:15,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:15,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:55:15,274 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:15,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1806029504, now seen corresponding path program 1 times [2021-01-06 19:55:15,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:15,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463901343] [2021-01-06 19:55:15,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:15,502 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2021-01-06 19:55:15,513 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:55:15,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463901343] [2021-01-06 19:55:15,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:15,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:55:15,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934457314] [2021-01-06 19:55:15,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:55:15,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:15,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:55:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:55:15,519 INFO L87 Difference]: Start difference. First operand 37063 states and 54342 transitions. Second operand 8 states. [2021-01-06 19:55:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:20,820 INFO L93 Difference]: Finished difference Result 68718 states and 99861 transitions. [2021-01-06 19:55:20,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:55:20,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2021-01-06 19:55:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:20,894 INFO L225 Difference]: With dead ends: 68718 [2021-01-06 19:55:20,895 INFO L226 Difference]: Without dead ends: 68716 [2021-01-06 19:55:20,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:55:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68716 states. [2021-01-06 19:55:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68716 to 38599. [2021-01-06 19:55:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38599 states. [2021-01-06 19:55:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38599 states to 38599 states and 55750 transitions. [2021-01-06 19:55:24,643 INFO L78 Accepts]: Start accepts. Automaton has 38599 states and 55750 transitions. Word has length 108 [2021-01-06 19:55:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:24,644 INFO L481 AbstractCegarLoop]: Abstraction has 38599 states and 55750 transitions. [2021-01-06 19:55:24,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:55:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 38599 states and 55750 transitions. [2021-01-06 19:55:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 19:55:24,668 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:24,669 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:24,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:55:24,669 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:24,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1724405917, now seen corresponding path program 1 times [2021-01-06 19:55:24,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:24,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71486302] [2021-01-06 19:55:24,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 19:55:24,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71486302] [2021-01-06 19:55:24,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:24,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:55:24,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599346657] [2021-01-06 19:55:24,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:55:24,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:24,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:55:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:55:24,931 INFO L87 Difference]: Start difference. First operand 38599 states and 55750 transitions. Second operand 10 states. [2021-01-06 19:55:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:49,275 INFO L93 Difference]: Finished difference Result 354265 states and 511503 transitions. [2021-01-06 19:55:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:55:49,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 147 [2021-01-06 19:55:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:49,992 INFO L225 Difference]: With dead ends: 354265 [2021-01-06 19:55:49,992 INFO L226 Difference]: Without dead ends: 315735 [2021-01-06 19:55:50,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:55:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315735 states. [2021-01-06 19:55:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315735 to 77127. [2021-01-06 19:55:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77127 states. [2021-01-06 19:55:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77127 states to 77127 states and 111046 transitions. [2021-01-06 19:55:59,102 INFO L78 Accepts]: Start accepts. Automaton has 77127 states and 111046 transitions. Word has length 147 [2021-01-06 19:55:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:59,103 INFO L481 AbstractCegarLoop]: Abstraction has 77127 states and 111046 transitions. [2021-01-06 19:55:59,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:55:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 77127 states and 111046 transitions. [2021-01-06 19:55:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 19:55:59,132 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:59,133 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:59,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:55:59,133 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:59,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:59,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1323053763, now seen corresponding path program 1 times [2021-01-06 19:55:59,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:59,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338408563] [2021-01-06 19:55:59,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 19:55:59,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338408563] [2021-01-06 19:55:59,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:59,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:55:59,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184711371] [2021-01-06 19:55:59,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:55:59,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:59,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:55:59,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:55:59,406 INFO L87 Difference]: Start difference. First operand 77127 states and 111046 transitions. Second operand 10 states. [2021-01-06 19:56:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:28,572 INFO L93 Difference]: Finished difference Result 392793 states and 566799 transitions. [2021-01-06 19:56:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:56:28,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 147 [2021-01-06 19:56:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:29,208 INFO L225 Difference]: With dead ends: 392793 [2021-01-06 19:56:29,209 INFO L226 Difference]: Without dead ends: 354263 [2021-01-06 19:56:29,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:56:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354263 states. [2021-01-06 19:56:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354263 to 134983. [2021-01-06 19:56:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134983 states. [2021-01-06 19:56:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134983 states to 134983 states and 193670 transitions. [2021-01-06 19:56:44,134 INFO L78 Accepts]: Start accepts. Automaton has 134983 states and 193670 transitions. Word has length 147 [2021-01-06 19:56:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:44,134 INFO L481 AbstractCegarLoop]: Abstraction has 134983 states and 193670 transitions. [2021-01-06 19:56:44,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:56:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 134983 states and 193670 transitions. [2021-01-06 19:56:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 19:56:44,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:44,161 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:56:44,162 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:44,162 INFO L82 PathProgramCache]: Analyzing trace with hash 146379219, now seen corresponding path program 1 times [2021-01-06 19:56:44,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:44,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189758595] [2021-01-06 19:56:44,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 19:56:44,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189758595] [2021-01-06 19:56:44,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:44,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:56:44,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435906030] [2021-01-06 19:56:44,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:56:44,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:56:44,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:56:44,367 INFO L87 Difference]: Start difference. First operand 134983 states and 193670 transitions. Second operand 10 states. [2021-01-06 19:57:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:20,737 INFO L93 Difference]: Finished difference Result 431321 states and 622095 transitions. [2021-01-06 19:57:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:57:20,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 147 [2021-01-06 19:57:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:21,530 INFO L225 Difference]: With dead ends: 431321 [2021-01-06 19:57:21,530 INFO L226 Difference]: Without dead ends: 392791 [2021-01-06 19:57:21,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:57:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392791 states. [2021-01-06 19:57:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392791 to 173511. [2021-01-06 19:57:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173511 states. [2021-01-06 19:57:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173511 states to 173511 states and 248966 transitions. [2021-01-06 19:57:41,612 INFO L78 Accepts]: Start accepts. Automaton has 173511 states and 248966 transitions. Word has length 147 [2021-01-06 19:57:41,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:41,613 INFO L481 AbstractCegarLoop]: Abstraction has 173511 states and 248966 transitions. [2021-01-06 19:57:41,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:57:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 173511 states and 248966 transitions. [2021-01-06 19:57:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 19:57:41,639 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:41,639 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:57:41,640 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:41,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1089079821, now seen corresponding path program 1 times [2021-01-06 19:57:41,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:41,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607653897] [2021-01-06 19:57:41,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:57:42,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607653897] [2021-01-06 19:57:42,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:42,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:57:42,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902220335] [2021-01-06 19:57:42,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:57:42,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:42,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:57:42,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:57:42,253 INFO L87 Difference]: Start difference. First operand 173511 states and 248966 transitions. Second operand 10 states. [2021-01-06 19:58:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:26,771 INFO L93 Difference]: Finished difference Result 469849 states and 677391 transitions. [2021-01-06 19:58:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:58:26,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 147 [2021-01-06 19:58:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:27,729 INFO L225 Difference]: With dead ends: 469849 [2021-01-06 19:58:27,729 INFO L226 Difference]: Without dead ends: 431319 [2021-01-06 19:58:27,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:58:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431319 states.