/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/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:22:10,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:22:10,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:22:10,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:22:10,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:22:10,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:22:10,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:22:10,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:22:10,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:22:10,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:22:10,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:22:10,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:22:10,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:22:10,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:22:10,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:22:10,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:22:10,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:22:10,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:22:10,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:22:10,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:22:10,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:22:10,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:22:10,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:22:10,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:22:10,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:22:10,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:22:10,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:22:10,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:22:10,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:22:10,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:22:10,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:22:10,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:22:10,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:22:10,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:22:10,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:22:10,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:22:10,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:22:10,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:22:10,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:22:10,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:22:10,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:22:10,996 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:22:11,025 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:22:11,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:22:11,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:22:11,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:22:11,027 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:22:11,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:22:11,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:22:11,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:22:11,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:22:11,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:22:11,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:22:11,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:22:11,028 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:22:11,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:22:11,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:22:11,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:22:11,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:22:11,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:22:11,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:22:11,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:22:11,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:22:11,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:22:11,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:22:11,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:22:11,031 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:22:11,031 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:22:11,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:22:11,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:22:11,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:22:11,478 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:22:11,479 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:22:11,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2021-01-06 19:22:11,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6f1ee8690/555a01ac0b694370938001dc08220007/FLAG53e4a50bb [2021-01-06 19:22:12,259 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:22:12,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2021-01-06 19:22:12,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6f1ee8690/555a01ac0b694370938001dc08220007/FLAG53e4a50bb [2021-01-06 19:22:12,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6f1ee8690/555a01ac0b694370938001dc08220007 [2021-01-06 19:22:12,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:22:12,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:22:12,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:22:12,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:22:12,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:22:12,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:22:12" (1/1) ... [2021-01-06 19:22:12,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3342a921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:12, skipping insertion in model container [2021-01-06 19:22:12,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:22:12" (1/1) ... [2021-01-06 19:22:12,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:22:12,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:22:12,899 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/systemc/bist_cell.cil.c[334,347] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~b0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~b0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] [2021-01-06 19:22:13,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:22:13,079 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:22:13,096 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/systemc/bist_cell.cil.c[334,347] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~b0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~b0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] [2021-01-06 19:22:13,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:22:13,213 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:22:13,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:13 WrapperNode [2021-01-06 19:22:13,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:22:13,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:22:13,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:22:13,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:22:13,227 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:22:13" (1/1) ... [2021-01-06 19:22:13,256 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:22:13" (1/1) ... [2021-01-06 19:22:13,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:22:13,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:22:13,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:22:13,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:22:13,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:13" (1/1) ... [2021-01-06 19:22:13,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:13" (1/1) ... [2021-01-06 19:22:13,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:13" (1/1) ... [2021-01-06 19:22:13,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:13" (1/1) ... [2021-01-06 19:22:13,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:13" (1/1) ... [2021-01-06 19:22:13,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:13" (1/1) ... [2021-01-06 19:22:13,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:13" (1/1) ... [2021-01-06 19:22:13,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:22:13,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:22:13,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:22:13,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:22:13,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:13" (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:22:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:22:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:22:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:22:13,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:22:14,103 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:22:14,103 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2021-01-06 19:22:14,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:22:14 BoogieIcfgContainer [2021-01-06 19:22:14,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:22:14,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:22:14,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:22:14,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:22:14,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:22:12" (1/3) ... [2021-01-06 19:22:14,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebcb72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:22:14, skipping insertion in model container [2021-01-06 19:22:14,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:22:13" (2/3) ... [2021-01-06 19:22:14,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebcb72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:22:14, skipping insertion in model container [2021-01-06 19:22:14,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:22:14" (3/3) ... [2021-01-06 19:22:14,115 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2021-01-06 19:22:14,122 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:22:14,128 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:22:14,147 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:22:14,176 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:22:14,177 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:22:14,177 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:22:14,177 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:22:14,177 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:22:14,177 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:22:14,178 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:22:14,178 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:22:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2021-01-06 19:22:14,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 19:22:14,204 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:14,205 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] [2021-01-06 19:22:14,205 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:14,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:14,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2021-01-06 19:22:14,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:14,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760871522] [2021-01-06 19:22:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:14,494 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:22:14,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760871522] [2021-01-06 19:22:14,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:14,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:14,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487075580] [2021-01-06 19:22:14,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:14,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:14,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:14,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:14,529 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2021-01-06 19:22:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:14,627 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2021-01-06 19:22:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:14,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-06 19:22:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:14,642 INFO L225 Difference]: With dead ends: 210 [2021-01-06 19:22:14,642 INFO L226 Difference]: Without dead ends: 104 [2021-01-06 19:22:14,646 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:22:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-06 19:22:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-01-06 19:22:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-01-06 19:22:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2021-01-06 19:22:14,767 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2021-01-06 19:22:14,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:14,768 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2021-01-06 19:22:14,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2021-01-06 19:22:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:22:14,774 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:14,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:14,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:22:14,776 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2021-01-06 19:22:14,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:14,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039055748] [2021-01-06 19:22:14,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:14,880 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:22:14,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039055748] [2021-01-06 19:22:14,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:14,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:14,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121083938] [2021-01-06 19:22:14,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:14,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:14,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:14,885 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2021-01-06 19:22:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:14,911 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2021-01-06 19:22:14,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:14,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 19:22:14,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:14,914 INFO L225 Difference]: With dead ends: 199 [2021-01-06 19:22:14,914 INFO L226 Difference]: Without dead ends: 104 [2021-01-06 19:22:14,915 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:22:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-06 19:22:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-01-06 19:22:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-01-06 19:22:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2021-01-06 19:22:14,926 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2021-01-06 19:22:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:14,926 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2021-01-06 19:22:14,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2021-01-06 19:22:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 19:22:14,929 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:14,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:14,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:22:14,929 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:14,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2021-01-06 19:22:14,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:14,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584552197] [2021-01-06 19:22:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:14,992 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:22:14,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584552197] [2021-01-06 19:22:14,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:14,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:14,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097422358] [2021-01-06 19:22:14,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:14,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:14,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:14,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:14,995 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2021-01-06 19:22:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:15,014 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2021-01-06 19:22:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:15,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 19:22:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:15,016 INFO L225 Difference]: With dead ends: 196 [2021-01-06 19:22:15,016 INFO L226 Difference]: Without dead ends: 104 [2021-01-06 19:22:15,017 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:22:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-06 19:22:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-01-06 19:22:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-01-06 19:22:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2021-01-06 19:22:15,028 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2021-01-06 19:22:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:15,028 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2021-01-06 19:22:15,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2021-01-06 19:22:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:22:15,031 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:15,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:15,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:22:15,032 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2021-01-06 19:22:15,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:15,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5022384] [2021-01-06 19:22:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:15,104 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:22:15,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5022384] [2021-01-06 19:22:15,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:15,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:15,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750829152] [2021-01-06 19:22:15,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:15,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:15,107 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2021-01-06 19:22:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:15,125 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2021-01-06 19:22:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:15,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 19:22:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:15,127 INFO L225 Difference]: With dead ends: 193 [2021-01-06 19:22:15,127 INFO L226 Difference]: Without dead ends: 104 [2021-01-06 19:22:15,128 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:22:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-06 19:22:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-01-06 19:22:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-01-06 19:22:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2021-01-06 19:22:15,138 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2021-01-06 19:22:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:15,138 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2021-01-06 19:22:15,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2021-01-06 19:22:15,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:22:15,140 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:15,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:15,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:22:15,141 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:15,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2021-01-06 19:22:15,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:15,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056702504] [2021-01-06 19:22:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:15,262 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:22:15,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056702504] [2021-01-06 19:22:15,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:15,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:15,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201452531] [2021-01-06 19:22:15,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:15,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:15,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:15,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:15,265 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2021-01-06 19:22:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:15,301 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2021-01-06 19:22:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:15,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:22:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:15,304 INFO L225 Difference]: With dead ends: 271 [2021-01-06 19:22:15,304 INFO L226 Difference]: Without dead ends: 191 [2021-01-06 19:22:15,305 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:22:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-01-06 19:22:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2021-01-06 19:22:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2021-01-06 19:22:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2021-01-06 19:22:15,323 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2021-01-06 19:22:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:15,323 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2021-01-06 19:22:15,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2021-01-06 19:22:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:22:15,326 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:15,327 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:15,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:22:15,327 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2021-01-06 19:22:15,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:15,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646215839] [2021-01-06 19:22:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:15,442 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:22:15,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646215839] [2021-01-06 19:22:15,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:15,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:22:15,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060954362] [2021-01-06 19:22:15,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:22:15,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:15,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:22:15,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:22:15,449 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 6 states. [2021-01-06 19:22:15,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:15,599 INFO L93 Difference]: Finished difference Result 444 states and 708 transitions. [2021-01-06 19:22:15,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:22:15,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2021-01-06 19:22:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:15,604 INFO L225 Difference]: With dead ends: 444 [2021-01-06 19:22:15,605 INFO L226 Difference]: Without dead ends: 261 [2021-01-06 19:22:15,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:22:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-01-06 19:22:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 194. [2021-01-06 19:22:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2021-01-06 19:22:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2021-01-06 19:22:15,624 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 72 [2021-01-06 19:22:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:15,624 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2021-01-06 19:22:15,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:22:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2021-01-06 19:22:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:22:15,626 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:15,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:15,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:22:15,627 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash -333833310, now seen corresponding path program 1 times [2021-01-06 19:22:15,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:15,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044869249] [2021-01-06 19:22:15,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:15,678 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:22:15,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044869249] [2021-01-06 19:22:15,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:15,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:15,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648432124] [2021-01-06 19:22:15,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:15,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:15,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:15,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:15,681 INFO L87 Difference]: Start difference. First operand 194 states and 310 transitions. Second operand 3 states. [2021-01-06 19:22:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:15,717 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2021-01-06 19:22:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:15,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:22:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:15,719 INFO L225 Difference]: With dead ends: 408 [2021-01-06 19:22:15,720 INFO L226 Difference]: Without dead ends: 271 [2021-01-06 19:22:15,723 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:22:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-01-06 19:22:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2021-01-06 19:22:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2021-01-06 19:22:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2021-01-06 19:22:15,739 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 72 [2021-01-06 19:22:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:15,740 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2021-01-06 19:22:15,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2021-01-06 19:22:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:22:15,742 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:15,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:15,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:22:15,743 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1594439392, now seen corresponding path program 1 times [2021-01-06 19:22:15,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:15,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469593693] [2021-01-06 19:22:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:15,802 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:22:15,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469593693] [2021-01-06 19:22:15,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:15,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:22:15,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504153464] [2021-01-06 19:22:15,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:22:15,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:15,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:22:15,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:15,806 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand 5 states. [2021-01-06 19:22:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:15,890 INFO L93 Difference]: Finished difference Result 622 states and 975 transitions. [2021-01-06 19:22:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:22:15,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:22:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:15,894 INFO L225 Difference]: With dead ends: 622 [2021-01-06 19:22:15,894 INFO L226 Difference]: Without dead ends: 427 [2021-01-06 19:22:15,895 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:22:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-01-06 19:22:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 280. [2021-01-06 19:22:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2021-01-06 19:22:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2021-01-06 19:22:15,913 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 72 [2021-01-06 19:22:15,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:15,913 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2021-01-06 19:22:15,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:22:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2021-01-06 19:22:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:22:15,915 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:15,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:15,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:22:15,915 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1043865723, now seen corresponding path program 1 times [2021-01-06 19:22:15,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:15,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641025595] [2021-01-06 19:22:15,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:15,952 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:22:15,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641025595] [2021-01-06 19:22:15,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:15,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:15,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492328136] [2021-01-06 19:22:15,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:15,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:15,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:15,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:15,956 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand 3 states. [2021-01-06 19:22:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:16,000 INFO L93 Difference]: Finished difference Result 563 states and 879 transitions. [2021-01-06 19:22:16,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:16,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 19:22:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:16,003 INFO L225 Difference]: With dead ends: 563 [2021-01-06 19:22:16,003 INFO L226 Difference]: Without dead ends: 332 [2021-01-06 19:22:16,004 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:22:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-01-06 19:22:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2021-01-06 19:22:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2021-01-06 19:22:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 491 transitions. [2021-01-06 19:22:16,019 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 491 transitions. Word has length 75 [2021-01-06 19:22:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:16,019 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 491 transitions. [2021-01-06 19:22:16,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 491 transitions. [2021-01-06 19:22:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:22:16,021 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:16,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:16,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:22:16,022 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:16,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:16,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1477594809, now seen corresponding path program 1 times [2021-01-06 19:22:16,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:16,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284300006] [2021-01-06 19:22:16,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:16,056 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:22:16,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284300006] [2021-01-06 19:22:16,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:16,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:16,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491848495] [2021-01-06 19:22:16,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:16,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:16,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:16,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:16,059 INFO L87 Difference]: Start difference. First operand 320 states and 491 transitions. Second operand 3 states. [2021-01-06 19:22:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:16,105 INFO L93 Difference]: Finished difference Result 567 states and 864 transitions. [2021-01-06 19:22:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:16,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 19:22:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:16,107 INFO L225 Difference]: With dead ends: 567 [2021-01-06 19:22:16,108 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 19:22:16,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:22:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 19:22:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-01-06 19:22:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2021-01-06 19:22:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2021-01-06 19:22:16,122 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 75 [2021-01-06 19:22:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:16,122 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2021-01-06 19:22:16,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2021-01-06 19:22:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 19:22:16,123 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:16,124 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:16,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:22:16,124 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash 969577782, now seen corresponding path program 1 times [2021-01-06 19:22:16,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:16,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920804247] [2021-01-06 19:22:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:16,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920804247] [2021-01-06 19:22:16,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:16,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:22:16,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187002443] [2021-01-06 19:22:16,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:22:16,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:16,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:22:16,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:22:16,180 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand 4 states. [2021-01-06 19:22:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:16,231 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2021-01-06 19:22:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:22:16,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2021-01-06 19:22:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:16,235 INFO L225 Difference]: With dead ends: 811 [2021-01-06 19:22:16,235 INFO L226 Difference]: Without dead ends: 580 [2021-01-06 19:22:16,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:22:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-01-06 19:22:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2021-01-06 19:22:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2021-01-06 19:22:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 846 transitions. [2021-01-06 19:22:16,267 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 846 transitions. Word has length 86 [2021-01-06 19:22:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:16,267 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 846 transitions. [2021-01-06 19:22:16,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:22:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 846 transitions. [2021-01-06 19:22:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:22:16,269 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:16,269 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:16,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:22:16,269 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash -272932917, now seen corresponding path program 1 times [2021-01-06 19:22:16,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:16,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077067604] [2021-01-06 19:22:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:16,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:16,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077067604] [2021-01-06 19:22:16,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:16,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:22:16,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062175037] [2021-01-06 19:22:16,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:22:16,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:16,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:22:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:16,333 INFO L87 Difference]: Start difference. First operand 574 states and 846 transitions. Second operand 5 states. [2021-01-06 19:22:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:16,412 INFO L93 Difference]: Finished difference Result 1097 states and 1620 transitions. [2021-01-06 19:22:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:22:16,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2021-01-06 19:22:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:16,416 INFO L225 Difference]: With dead ends: 1097 [2021-01-06 19:22:16,416 INFO L226 Difference]: Without dead ends: 574 [2021-01-06 19:22:16,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:22:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-01-06 19:22:16,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2021-01-06 19:22:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2021-01-06 19:22:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 842 transitions. [2021-01-06 19:22:16,458 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 842 transitions. Word has length 87 [2021-01-06 19:22:16,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:16,458 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 842 transitions. [2021-01-06 19:22:16,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:22:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 842 transitions. [2021-01-06 19:22:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 19:22:16,460 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:16,460 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:16,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:22:16,461 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:16,461 INFO L82 PathProgramCache]: Analyzing trace with hash 754091632, now seen corresponding path program 1 times [2021-01-06 19:22:16,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:16,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185806326] [2021-01-06 19:22:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:16,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185806326] [2021-01-06 19:22:16,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:16,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:16,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905579520] [2021-01-06 19:22:16,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:16,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:16,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:16,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:16,516 INFO L87 Difference]: Start difference. First operand 574 states and 842 transitions. Second operand 3 states. [2021-01-06 19:22:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:16,591 INFO L93 Difference]: Finished difference Result 1592 states and 2334 transitions. [2021-01-06 19:22:16,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:16,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-01-06 19:22:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:16,597 INFO L225 Difference]: With dead ends: 1592 [2021-01-06 19:22:16,597 INFO L226 Difference]: Without dead ends: 1069 [2021-01-06 19:22:16,599 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:22:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-01-06 19:22:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 586. [2021-01-06 19:22:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2021-01-06 19:22:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 854 transitions. [2021-01-06 19:22:16,641 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 854 transitions. Word has length 88 [2021-01-06 19:22:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:16,641 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 854 transitions. [2021-01-06 19:22:16,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 854 transitions. [2021-01-06 19:22:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 19:22:16,643 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:16,643 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:16,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:22:16,644 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash -715020230, now seen corresponding path program 1 times [2021-01-06 19:22:16,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:16,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661238158] [2021-01-06 19:22:16,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:16,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661238158] [2021-01-06 19:22:16,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:16,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:22:16,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380484148] [2021-01-06 19:22:16,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:22:16,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:16,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:22:16,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:16,710 INFO L87 Difference]: Start difference. First operand 586 states and 854 transitions. Second operand 5 states. [2021-01-06 19:22:16,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:16,793 INFO L93 Difference]: Finished difference Result 1105 states and 1604 transitions. [2021-01-06 19:22:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:22:16,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2021-01-06 19:22:16,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:16,797 INFO L225 Difference]: With dead ends: 1105 [2021-01-06 19:22:16,797 INFO L226 Difference]: Without dead ends: 570 [2021-01-06 19:22:16,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:22:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-01-06 19:22:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-01-06 19:22:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2021-01-06 19:22:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 818 transitions. [2021-01-06 19:22:16,845 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 818 transitions. Word has length 89 [2021-01-06 19:22:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:16,845 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 818 transitions. [2021-01-06 19:22:16,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:22:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 818 transitions. [2021-01-06 19:22:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:22:16,847 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:16,847 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:16,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:22:16,848 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:16,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:16,848 INFO L82 PathProgramCache]: Analyzing trace with hash -995630559, now seen corresponding path program 1 times [2021-01-06 19:22:16,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:16,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563378447] [2021-01-06 19:22:16,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:16,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563378447] [2021-01-06 19:22:16,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:16,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:16,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000681017] [2021-01-06 19:22:16,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:16,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:16,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:16,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:16,891 INFO L87 Difference]: Start difference. First operand 570 states and 818 transitions. Second operand 3 states. [2021-01-06 19:22:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:17,003 INFO L93 Difference]: Finished difference Result 1592 states and 2288 transitions. [2021-01-06 19:22:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:17,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:22:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:17,009 INFO L225 Difference]: With dead ends: 1592 [2021-01-06 19:22:17,010 INFO L226 Difference]: Without dead ends: 1073 [2021-01-06 19:22:17,013 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:22:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-01-06 19:22:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 578. [2021-01-06 19:22:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2021-01-06 19:22:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 826 transitions. [2021-01-06 19:22:17,067 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 826 transitions. Word has length 90 [2021-01-06 19:22:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:17,068 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 826 transitions. [2021-01-06 19:22:17,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 826 transitions. [2021-01-06 19:22:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:22:17,070 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:17,070 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:17,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:22:17,070 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:17,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:17,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1893023837, now seen corresponding path program 1 times [2021-01-06 19:22:17,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:17,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310250562] [2021-01-06 19:22:17,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:17,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310250562] [2021-01-06 19:22:17,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:17,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:17,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903411968] [2021-01-06 19:22:17,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:17,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:17,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:17,112 INFO L87 Difference]: Start difference. First operand 578 states and 826 transitions. Second operand 3 states. [2021-01-06 19:22:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:17,182 INFO L93 Difference]: Finished difference Result 1311 states and 1876 transitions. [2021-01-06 19:22:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:17,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:22:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:17,187 INFO L225 Difference]: With dead ends: 1311 [2021-01-06 19:22:17,187 INFO L226 Difference]: Without dead ends: 784 [2021-01-06 19:22:17,188 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:22:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-01-06 19:22:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 706. [2021-01-06 19:22:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2021-01-06 19:22:17,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1022 transitions. [2021-01-06 19:22:17,245 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1022 transitions. Word has length 90 [2021-01-06 19:22:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:17,245 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 1022 transitions. [2021-01-06 19:22:17,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1022 transitions. [2021-01-06 19:22:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:22:17,247 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:17,247 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:17,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:22:17,248 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:17,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1064241767, now seen corresponding path program 1 times [2021-01-06 19:22:17,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:17,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289685482] [2021-01-06 19:22:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:17,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289685482] [2021-01-06 19:22:17,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623072362] [2021-01-06 19:22:17,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:17,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:22:17,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:17,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:22:17,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 19:22:17,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985944251] [2021-01-06 19:22:17,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:17,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:17,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:17,601 INFO L87 Difference]: Start difference. First operand 706 states and 1022 transitions. Second operand 3 states. [2021-01-06 19:22:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:17,704 INFO L93 Difference]: Finished difference Result 1341 states and 1945 transitions. [2021-01-06 19:22:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:17,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 19:22:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:17,709 INFO L225 Difference]: With dead ends: 1341 [2021-01-06 19:22:17,709 INFO L226 Difference]: Without dead ends: 686 [2021-01-06 19:22:17,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-01-06 19:22:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2021-01-06 19:22:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2021-01-06 19:22:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 979 transitions. [2021-01-06 19:22:17,795 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 979 transitions. Word has length 92 [2021-01-06 19:22:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:17,796 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 979 transitions. [2021-01-06 19:22:17,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 979 transitions. [2021-01-06 19:22:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:22:17,799 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:17,799 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:18,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 19:22:18,014 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:18,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:18,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1841919225, now seen corresponding path program 1 times [2021-01-06 19:22:18,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:18,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368251935] [2021-01-06 19:22:18,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:18,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368251935] [2021-01-06 19:22:18,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923239225] [2021-01-06 19:22:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:18,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:22:18,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:18,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:22:18,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 19:22:18,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10910431] [2021-01-06 19:22:18,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:18,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:18,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:18,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:18,297 INFO L87 Difference]: Start difference. First operand 686 states and 979 transitions. Second operand 3 states. [2021-01-06 19:22:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:18,436 INFO L93 Difference]: Finished difference Result 2025 states and 2894 transitions. [2021-01-06 19:22:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:18,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-01-06 19:22:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:18,444 INFO L225 Difference]: With dead ends: 2025 [2021-01-06 19:22:18,444 INFO L226 Difference]: Without dead ends: 1364 [2021-01-06 19:22:18,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-01-06 19:22:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1361. [2021-01-06 19:22:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2021-01-06 19:22:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1921 transitions. [2021-01-06 19:22:18,562 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1921 transitions. Word has length 93 [2021-01-06 19:22:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:18,563 INFO L481 AbstractCegarLoop]: Abstraction has 1361 states and 1921 transitions. [2021-01-06 19:22:18,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1921 transitions. [2021-01-06 19:22:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:22:18,565 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:18,565 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:18,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 19:22:18,779 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:18,780 INFO L82 PathProgramCache]: Analyzing trace with hash 155739387, now seen corresponding path program 1 times [2021-01-06 19:22:18,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:18,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202040809] [2021-01-06 19:22:18,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:18,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202040809] [2021-01-06 19:22:18,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:18,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:18,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762273868] [2021-01-06 19:22:18,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:18,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:18,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:18,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:18,814 INFO L87 Difference]: Start difference. First operand 1361 states and 1921 transitions. Second operand 3 states. [2021-01-06 19:22:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:18,956 INFO L93 Difference]: Finished difference Result 2736 states and 3861 transitions. [2021-01-06 19:22:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:18,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-01-06 19:22:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:18,964 INFO L225 Difference]: With dead ends: 2736 [2021-01-06 19:22:18,965 INFO L226 Difference]: Without dead ends: 1463 [2021-01-06 19:22:18,967 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:22:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2021-01-06 19:22:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2021-01-06 19:22:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2021-01-06 19:22:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2048 transitions. [2021-01-06 19:22:19,077 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2048 transitions. Word has length 93 [2021-01-06 19:22:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:19,078 INFO L481 AbstractCegarLoop]: Abstraction has 1463 states and 2048 transitions. [2021-01-06 19:22:19,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2048 transitions. [2021-01-06 19:22:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:22:19,080 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:19,081 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:19,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:22:19,081 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1889843837, now seen corresponding path program 1 times [2021-01-06 19:22:19,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:19,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093752343] [2021-01-06 19:22:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:19,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093752343] [2021-01-06 19:22:19,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:19,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:19,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370968669] [2021-01-06 19:22:19,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:19,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:19,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:19,114 INFO L87 Difference]: Start difference. First operand 1463 states and 2048 transitions. Second operand 3 states. [2021-01-06 19:22:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:19,209 INFO L93 Difference]: Finished difference Result 2354 states and 3302 transitions. [2021-01-06 19:22:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:19,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-01-06 19:22:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:19,214 INFO L225 Difference]: With dead ends: 2354 [2021-01-06 19:22:19,215 INFO L226 Difference]: Without dead ends: 973 [2021-01-06 19:22:19,217 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:22:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-01-06 19:22:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2021-01-06 19:22:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2021-01-06 19:22:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1351 transitions. [2021-01-06 19:22:19,293 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1351 transitions. Word has length 93 [2021-01-06 19:22:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:19,294 INFO L481 AbstractCegarLoop]: Abstraction has 973 states and 1351 transitions. [2021-01-06 19:22:19,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1351 transitions. [2021-01-06 19:22:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:22:19,296 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:19,296 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:19,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:22:19,297 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:19,297 INFO L82 PathProgramCache]: Analyzing trace with hash 852035983, now seen corresponding path program 1 times [2021-01-06 19:22:19,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:19,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302540211] [2021-01-06 19:22:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:19,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302540211] [2021-01-06 19:22:19,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:19,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:22:19,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772054898] [2021-01-06 19:22:19,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:22:19,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:19,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:22:19,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:22:19,367 INFO L87 Difference]: Start difference. First operand 973 states and 1351 transitions. Second operand 4 states. [2021-01-06 19:22:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:19,412 INFO L93 Difference]: Finished difference Result 1258 states and 1743 transitions. [2021-01-06 19:22:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:22:19,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2021-01-06 19:22:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:19,415 INFO L225 Difference]: With dead ends: 1258 [2021-01-06 19:22:19,415 INFO L226 Difference]: Without dead ends: 373 [2021-01-06 19:22:19,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:22:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-01-06 19:22:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2021-01-06 19:22:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2021-01-06 19:22:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2021-01-06 19:22:19,448 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 94 [2021-01-06 19:22:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:19,448 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2021-01-06 19:22:19,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:22:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2021-01-06 19:22:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:22:19,449 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:19,450 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:19,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:22:19,450 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1821155806, now seen corresponding path program 1 times [2021-01-06 19:22:19,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:19,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123720237] [2021-01-06 19:22:19,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:19,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123720237] [2021-01-06 19:22:19,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865278208] [2021-01-06 19:22:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:19,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:22:19,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:19,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:22:19,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 19:22:19,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893072093] [2021-01-06 19:22:19,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:19,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:19,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:19,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:19,677 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand 3 states. [2021-01-06 19:22:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:19,790 INFO L93 Difference]: Finished difference Result 1059 states and 1432 transitions. [2021-01-06 19:22:19,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:19,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-01-06 19:22:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:19,795 INFO L225 Difference]: With dead ends: 1059 [2021-01-06 19:22:19,795 INFO L226 Difference]: Without dead ends: 732 [2021-01-06 19:22:19,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-01-06 19:22:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 729. [2021-01-06 19:22:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2021-01-06 19:22:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 973 transitions. [2021-01-06 19:22:19,901 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 973 transitions. Word has length 94 [2021-01-06 19:22:19,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:19,901 INFO L481 AbstractCegarLoop]: Abstraction has 729 states and 973 transitions. [2021-01-06 19:22:19,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:19,902 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 973 transitions. [2021-01-06 19:22:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:22:19,906 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:19,906 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:20,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-06 19:22:20,120 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:20,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:20,120 INFO L82 PathProgramCache]: Analyzing trace with hash 134975968, now seen corresponding path program 1 times [2021-01-06 19:22:20,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:20,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139299981] [2021-01-06 19:22:20,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:20,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139299981] [2021-01-06 19:22:20,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:20,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:20,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127407943] [2021-01-06 19:22:20,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:20,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:20,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:20,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:20,177 INFO L87 Difference]: Start difference. First operand 729 states and 973 transitions. Second operand 3 states. [2021-01-06 19:22:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:20,289 INFO L93 Difference]: Finished difference Result 1382 states and 1844 transitions. [2021-01-06 19:22:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:20,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-01-06 19:22:20,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:20,294 INFO L225 Difference]: With dead ends: 1382 [2021-01-06 19:22:20,294 INFO L226 Difference]: Without dead ends: 811 [2021-01-06 19:22:20,296 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:22:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-01-06 19:22:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2021-01-06 19:22:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2021-01-06 19:22:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1067 transitions. [2021-01-06 19:22:20,368 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1067 transitions. Word has length 94 [2021-01-06 19:22:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:20,368 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1067 transitions. [2021-01-06 19:22:20,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1067 transitions. [2021-01-06 19:22:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:22:20,371 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:20,371 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:20,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:22:20,372 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1869080418, now seen corresponding path program 1 times [2021-01-06 19:22:20,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:20,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009245815] [2021-01-06 19:22:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:20,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009245815] [2021-01-06 19:22:20,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:20,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:22:20,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910142682] [2021-01-06 19:22:20,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:20,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:22:20,406 INFO L87 Difference]: Start difference. First operand 811 states and 1067 transitions. Second operand 3 states. [2021-01-06 19:22:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:20,470 INFO L93 Difference]: Finished difference Result 1208 states and 1594 transitions. [2021-01-06 19:22:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:20,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-01-06 19:22:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:20,473 INFO L225 Difference]: With dead ends: 1208 [2021-01-06 19:22:20,473 INFO L226 Difference]: Without dead ends: 551 [2021-01-06 19:22:20,475 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:22:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-01-06 19:22:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2021-01-06 19:22:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2021-01-06 19:22:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2021-01-06 19:22:20,520 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 94 [2021-01-06 19:22:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:20,521 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2021-01-06 19:22:20,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2021-01-06 19:22:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:22:20,523 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:20,523 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:20,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:22:20,523 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash 990151219, now seen corresponding path program 1 times [2021-01-06 19:22:20,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:20,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884452989] [2021-01-06 19:22:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:20,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884452989] [2021-01-06 19:22:20,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:20,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:22:20,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305824818] [2021-01-06 19:22:20,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:22:20,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:20,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:22:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:22:20,581 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand 4 states. [2021-01-06 19:22:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:20,644 INFO L93 Difference]: Finished difference Result 820 states and 1062 transitions. [2021-01-06 19:22:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:22:20,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 19:22:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:20,647 INFO L225 Difference]: With dead ends: 820 [2021-01-06 19:22:20,648 INFO L226 Difference]: Without dead ends: 427 [2021-01-06 19:22:20,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:22:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-01-06 19:22:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-01-06 19:22:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2021-01-06 19:22:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 542 transitions. [2021-01-06 19:22:20,687 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 542 transitions. Word has length 95 [2021-01-06 19:22:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:20,688 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 542 transitions. [2021-01-06 19:22:20,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:22:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 542 transitions. [2021-01-06 19:22:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:22:20,690 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:20,690 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:20,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:22:20,690 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:20,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1943155422, now seen corresponding path program 1 times [2021-01-06 19:22:20,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:20,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021328953] [2021-01-06 19:22:20,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:20,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021328953] [2021-01-06 19:22:20,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845930531] [2021-01-06 19:22:20,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:20,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:22:20,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:20,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:22:20,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 19:22:20,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576863012] [2021-01-06 19:22:20,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:22:20,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:22:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:20,911 INFO L87 Difference]: Start difference. First operand 427 states and 542 transitions. Second operand 3 states. [2021-01-06 19:22:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:21,004 INFO L93 Difference]: Finished difference Result 1163 states and 1470 transitions. [2021-01-06 19:22:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:22:21,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-01-06 19:22:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:21,009 INFO L225 Difference]: With dead ends: 1163 [2021-01-06 19:22:21,009 INFO L226 Difference]: Without dead ends: 822 [2021-01-06 19:22:21,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-01-06 19:22:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2021-01-06 19:22:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2021-01-06 19:22:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2021-01-06 19:22:21,092 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 95 [2021-01-06 19:22:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:21,093 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2021-01-06 19:22:21,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:22:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2021-01-06 19:22:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:22:21,095 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:21,095 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:21,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:21,309 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:21,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:21,310 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2021-01-06 19:22:21,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:21,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591089367] [2021-01-06 19:22:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:21,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591089367] [2021-01-06 19:22:21,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984952652] [2021-01-06 19:22:21,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:21,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 19:22:21,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:21,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:22:21,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-01-06 19:22:21,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243343646] [2021-01-06 19:22:21,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:22:21,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:21,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:22:21,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:21,561 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand 4 states. [2021-01-06 19:22:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:21,685 INFO L93 Difference]: Finished difference Result 1704 states and 2152 transitions. [2021-01-06 19:22:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:22:21,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 19:22:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:21,691 INFO L225 Difference]: With dead ends: 1704 [2021-01-06 19:22:21,691 INFO L226 Difference]: Without dead ends: 1054 [2021-01-06 19:22:21,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-01-06 19:22:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1012. [2021-01-06 19:22:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2021-01-06 19:22:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1268 transitions. [2021-01-06 19:22:21,795 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1268 transitions. Word has length 95 [2021-01-06 19:22:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:21,795 INFO L481 AbstractCegarLoop]: Abstraction has 1012 states and 1268 transitions. [2021-01-06 19:22:21,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:22:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1268 transitions. [2021-01-06 19:22:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:22:21,797 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:21,798 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:22,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-06 19:22:22,013 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:22,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:22,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2021-01-06 19:22:22,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:22,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932164424] [2021-01-06 19:22:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:22,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932164424] [2021-01-06 19:22:22,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:22,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:22:22,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139914659] [2021-01-06 19:22:22,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:22:22,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:22,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:22:22,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:22:22,062 INFO L87 Difference]: Start difference. First operand 1012 states and 1268 transitions. Second operand 4 states. [2021-01-06 19:22:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:22,247 INFO L93 Difference]: Finished difference Result 2540 states and 3200 transitions. [2021-01-06 19:22:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:22:22,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 19:22:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:22,255 INFO L225 Difference]: With dead ends: 2540 [2021-01-06 19:22:22,256 INFO L226 Difference]: Without dead ends: 1698 [2021-01-06 19:22:22,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:22:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2021-01-06 19:22:22,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1030. [2021-01-06 19:22:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2021-01-06 19:22:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1286 transitions. [2021-01-06 19:22:22,361 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1286 transitions. Word has length 95 [2021-01-06 19:22:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:22,362 INFO L481 AbstractCegarLoop]: Abstraction has 1030 states and 1286 transitions. [2021-01-06 19:22:22,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:22:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1286 transitions. [2021-01-06 19:22:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:22:22,364 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:22,365 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:22:22,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:22:22,365 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2021-01-06 19:22:22,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:22,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280110935] [2021-01-06 19:22:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:22:22,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280110935] [2021-01-06 19:22:22,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:22,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:22:22,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829215857] [2021-01-06 19:22:22,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:22:22,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:22,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:22:22,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:22:22,425 INFO L87 Difference]: Start difference. First operand 1030 states and 1286 transitions. Second operand 5 states. [2021-01-06 19:22:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:22,508 INFO L93 Difference]: Finished difference Result 1285 states and 1598 transitions. [2021-01-06 19:22:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:22:22,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2021-01-06 19:22:22,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:22,509 INFO L225 Difference]: With dead ends: 1285 [2021-01-06 19:22:22,509 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 19:22:22,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:22:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 19:22:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 19:22:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 19:22:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 19:22:22,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-01-06 19:22:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:22,512 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 19:22:22,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:22:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 19:22:22,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 19:22:22,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:22:22,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 19:22:23,623 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2021-01-06 19:22:23,831 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-01-06 19:22:24,044 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2021-01-06 19:22:24,266 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-01-06 19:22:24,462 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2021-01-06 19:22:24,629 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-01-06 19:22:24,809 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-01-06 19:22:24,943 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-01-06 19:22:25,276 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2021-01-06 19:22:25,486 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-01-06 19:22:25,601 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-01-06 19:22:25,820 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-01-06 19:22:26,001 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2021-01-06 19:22:26,114 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2021-01-06 19:22:26,267 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-01-06 19:22:26,387 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-01-06 19:22:26,492 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-01-06 19:22:26,756 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2021-01-06 19:22:27,012 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2021-01-06 19:22:27,146 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-01-06 19:22:27,367 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-01-06 19:22:27,679 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2021-01-06 19:22:27,860 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2021-01-06 19:22:28,050 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-01-06 19:22:28,251 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2021-01-06 19:22:28,455 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-01-06 19:22:28,679 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-01-06 19:22:28,683 INFO L189 CegarLoopUtils]: For program point L399(lines 399 404) no Hoare annotation was computed. [2021-01-06 19:22:28,684 INFO L185 CegarLoopUtils]: At program point L333-1(lines 309 341) the Hoare annotation is: (let ((.cse6 (<= 2 ~b1_ev~0)) (.cse0 (= ~d0_ev~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse16 (= ~b1_ev~0 1)) (.cse5 (not (= ~b1_val~0 0))) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse15 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14))) [2021-01-06 19:22:28,685 INFO L185 CegarLoopUtils]: At program point L267(lines 259 269) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) .cse13))) [2021-01-06 19:22:28,685 INFO L185 CegarLoopUtils]: At program point L366-3(lines 342 374) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2021-01-06 19:22:28,685 INFO L185 CegarLoopUtils]: At program point L333-3(lines 309 341) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 (= ~d0_ev~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-01-06 19:22:28,686 INFO L185 CegarLoopUtils]: At program point L267-1(lines 259 269) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (not (= ~b0_val~0 0)) (<= 2 ~d0_ev~0) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2021-01-06 19:22:28,686 INFO L185 CegarLoopUtils]: At program point L268(lines 256 270) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) .cse13))) [2021-01-06 19:22:28,686 INFO L185 CegarLoopUtils]: At program point L268-1(lines 256 270) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2021-01-06 19:22:28,686 INFO L189 CegarLoopUtils]: For program point L103(lines 103 118) no Hoare annotation was computed. [2021-01-06 19:22:28,686 INFO L189 CegarLoopUtils]: For program point L103-1(lines 103 118) no Hoare annotation was computed. [2021-01-06 19:22:28,686 INFO L189 CegarLoopUtils]: For program point L71(lines 43 93) no Hoare annotation was computed. [2021-01-06 19:22:28,687 INFO L192 CegarLoopUtils]: At program point L501(lines 485 503) the Hoare annotation is: true [2021-01-06 19:22:28,687 INFO L185 CegarLoopUtils]: At program point L303(lines 271 308) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2021-01-06 19:22:28,687 INFO L189 CegarLoopUtils]: For program point L204(lines 204 210) no Hoare annotation was computed. [2021-01-06 19:22:28,687 INFO L185 CegarLoopUtils]: At program point L204-1(lines 203 241) the Hoare annotation is: (and (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (= ~comp_m1_st~0 0) (= ~d1_req_up~0 1) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (not (= ~b0_val~0 0)) (<= 2 ~d0_ev~0) (= ~b0_ev~0 0) (= 1 ~b1_req_up~0) (not (= ~d1_val_t~0 0)) (= ~d0_req_up~0 1) (= 0 ~z_val_t~0) (<= 2 ~d1_ev~0)) [2021-01-06 19:22:28,687 INFO L189 CegarLoopUtils]: For program point L204-2(lines 204 210) no Hoare annotation was computed. [2021-01-06 19:22:28,687 INFO L185 CegarLoopUtils]: At program point L204-3(lines 203 241) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2021-01-06 19:22:28,688 INFO L189 CegarLoopUtils]: For program point L72(lines 72 76) no Hoare annotation was computed. [2021-01-06 19:22:28,688 INFO L189 CegarLoopUtils]: For program point L107(lines 107 117) no Hoare annotation was computed. [2021-01-06 19:22:28,688 INFO L189 CegarLoopUtils]: For program point L107-1(lines 107 117) no Hoare annotation was computed. [2021-01-06 19:22:28,688 INFO L189 CegarLoopUtils]: For program point L174(lines 174 179) no Hoare annotation was computed. [2021-01-06 19:22:28,688 INFO L189 CegarLoopUtils]: For program point L174-2(lines 174 179) no Hoare annotation was computed. [2021-01-06 19:22:28,688 INFO L189 CegarLoopUtils]: For program point L174-3(lines 174 179) no Hoare annotation was computed. [2021-01-06 19:22:28,688 INFO L189 CegarLoopUtils]: For program point L174-5(lines 174 179) no Hoare annotation was computed. [2021-01-06 19:22:28,689 INFO L185 CegarLoopUtils]: At program point L406(lines 395 408) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2021-01-06 19:22:28,689 INFO L185 CegarLoopUtils]: At program point L407(lines 391 409) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2021-01-06 19:22:28,689 INFO L189 CegarLoopUtils]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-01-06 19:22:28,689 INFO L189 CegarLoopUtils]: For program point L44-1(lines 43 93) no Hoare annotation was computed. [2021-01-06 19:22:28,689 INFO L189 CegarLoopUtils]: For program point L11(line 11) no Hoare annotation was computed. [2021-01-06 19:22:28,689 INFO L189 CegarLoopUtils]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-01-06 19:22:28,689 INFO L189 CegarLoopUtils]: For program point L144(lines 144 149) no Hoare annotation was computed. [2021-01-06 19:22:28,689 INFO L189 CegarLoopUtils]: For program point L111(lines 111 116) no Hoare annotation was computed. [2021-01-06 19:22:28,690 INFO L189 CegarLoopUtils]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2021-01-06 19:22:28,690 INFO L189 CegarLoopUtils]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2021-01-06 19:22:28,690 INFO L189 CegarLoopUtils]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-01-06 19:22:28,690 INFO L189 CegarLoopUtils]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2021-01-06 19:22:28,690 INFO L189 CegarLoopUtils]: For program point L144-5(lines 144 149) no Hoare annotation was computed. [2021-01-06 19:22:28,690 INFO L185 CegarLoopUtils]: At program point L211(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d0_val_t~0 0))) (.cse1 (= ~z_ev~0 2)) (.cse2 (= ~z_val~0 0)) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (= ~d1_req_up~0 1)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~b0_val~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (= ~b0_ev~0 0)) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= ~d0_req_up~0 1)) (.cse14 (= 0 ~z_val_t~0)) (.cse15 (<= 2 ~d1_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~b1_ev~0 0) .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~b1_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-01-06 19:22:28,690 INFO L185 CegarLoopUtils]: At program point L211-1(lines 203 241) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2021-01-06 19:22:28,691 INFO L189 CegarLoopUtils]: For program point L278(line 278) no Hoare annotation was computed. [2021-01-06 19:22:28,691 INFO L189 CegarLoopUtils]: For program point L346-1(lines 345 373) no Hoare annotation was computed. [2021-01-06 19:22:28,691 INFO L189 CegarLoopUtils]: For program point L313-1(lines 312 340) no Hoare annotation was computed. [2021-01-06 19:22:28,691 INFO L189 CegarLoopUtils]: For program point L313-2(lines 313 317) no Hoare annotation was computed. [2021-01-06 19:22:28,691 INFO L189 CegarLoopUtils]: For program point L346-3(lines 345 373) no Hoare annotation was computed. [2021-01-06 19:22:28,691 INFO L185 CegarLoopUtils]: At program point L247-1(lines 313 317) the Hoare annotation is: (let ((.cse7 (= ~d0_ev~0 0)) (.cse13 (= ~b1_ev~0 0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (not (= ~b1_val~0 0))) (.cse15 (<= 2 ~b1_ev~0)) (.cse5 (not (= ~b0_req_up~0 1))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~b0_val~0 0))) (.cse16 (<= 2 ~d0_ev~0)) (.cse9 (not (= 1 ~b1_req_up~0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~b0_ev~0 0)) (.cse12 (not (= ~d1_val_t~0 0))) (.cse14 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse14))) [2021-01-06 19:22:28,692 INFO L189 CegarLoopUtils]: For program point L313-4(lines 312 340) no Hoare annotation was computed. [2021-01-06 19:22:28,692 INFO L189 CegarLoopUtils]: For program point L83(lines 83 87) no Hoare annotation was computed. [2021-01-06 19:22:28,692 INFO L189 CegarLoopUtils]: For program point L83-2(lines 80 88) no Hoare annotation was computed. [2021-01-06 19:22:28,692 INFO L185 CegarLoopUtils]: At program point L447(lines 493 499) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~b1_val_t~0 0)) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (not (= 1 ~b1_req_up~0)) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_req_up~0 1))) [2021-01-06 19:22:28,692 INFO L189 CegarLoopUtils]: For program point L282(lines 282 286) no Hoare annotation was computed. [2021-01-06 19:22:28,692 INFO L189 CegarLoopUtils]: For program point L282-1(lines 277 302) no Hoare annotation was computed. [2021-01-06 19:22:28,692 INFO L189 CegarLoopUtils]: For program point L382(lines 382 386) no Hoare annotation was computed. [2021-01-06 19:22:28,693 INFO L185 CegarLoopUtils]: At program point L382-2(lines 346 350) the Hoare annotation is: (let ((.cse11 (<= 2 ~d0_ev~0)) (.cse5 (= ~b1_ev~0 1)) (.cse17 (= ~d0_ev~0 1)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse16 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15))) [2021-01-06 19:22:28,693 INFO L189 CegarLoopUtils]: For program point L382-3(lines 382 386) no Hoare annotation was computed. [2021-01-06 19:22:28,693 INFO L185 CegarLoopUtils]: At program point L382-5(lines 346 350) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 (= ~d0_ev~0 1) .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-01-06 19:22:28,693 INFO L185 CegarLoopUtils]: At program point L482(lines 453 484) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (= ~z_ev~0 2) (= ~z_val~0 0) (= ~comp_m1_st~0 0) (= ~d1_req_up~0 1) (= ~d1_val_t~0 ~b0_val_t~0) (<= 2 ~b1_ev~0) (= ~b0_val_t~0 1) (<= 2 ~d0_ev~0) (= ~b0_val~0 0) (= 1 ~b1_req_up~0) (= ~b1_val_t~0 ~b0_val_t~0) (= ~d0_req_up~0 1) (= 0 ~z_val_t~0) (= ~d0_val_t~0 ~b0_val_t~0) (= ~b0_req_up~0 1) (<= 2 ~d1_ev~0)) [2021-01-06 19:22:28,693 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 19:22:28,694 INFO L185 CegarLoopUtils]: At program point L218(lines 203 241) the Hoare annotation is: (let ((.cse9 (= ~d0_ev~0 0)) (.cse14 (= ~b1_ev~0 0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (= ~d1_req_up~0 1)) (.cse6 (not (= ~b1_val~0 0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~b0_val~0 0))) (.cse18 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~d1_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse15 .cse16))) [2021-01-06 19:22:28,694 INFO L185 CegarLoopUtils]: At program point L218-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-01-06 19:22:28,694 INFO L189 CegarLoopUtils]: For program point L53(lines 43 93) no Hoare annotation was computed. [2021-01-06 19:22:28,694 INFO L189 CegarLoopUtils]: For program point L351-1(lines 345 373) no Hoare annotation was computed. [2021-01-06 19:22:28,694 INFO L189 CegarLoopUtils]: For program point L318-1(lines 312 340) no Hoare annotation was computed. [2021-01-06 19:22:28,694 INFO L189 CegarLoopUtils]: For program point L351-3(lines 345 373) no Hoare annotation was computed. [2021-01-06 19:22:28,694 INFO L189 CegarLoopUtils]: For program point L318-3(lines 312 340) no Hoare annotation was computed. [2021-01-06 19:22:28,695 INFO L189 CegarLoopUtils]: For program point L54(lines 54 58) no Hoare annotation was computed. [2021-01-06 19:22:28,695 INFO L185 CegarLoopUtils]: At program point L121(lines 98 123) the Hoare annotation is: (let ((.cse5 (= ~b1_ev~0 1)) (.cse11 (<= 2 ~d0_ev~0)) (.cse16 (= ~d0_ev~0 1)) (.cse0 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15))) [2021-01-06 19:22:28,695 INFO L185 CegarLoopUtils]: At program point L121-1(lines 98 123) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= ~d0_ev~0 1) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-01-06 19:22:28,695 INFO L185 CegarLoopUtils]: At program point L287(lines 277 302) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~b0_val~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse13))) [2021-01-06 19:22:28,696 INFO L185 CegarLoopUtils]: At program point L122(lines 95 124) the Hoare annotation is: (let ((.cse5 (= ~b1_ev~0 1)) (.cse17 (= ~d0_ev~0 1)) (.cse0 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse18 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (<= 2 ~d0_ev~0)) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (= |ULTIMATE.start_is_method1_triggered_#res| 1)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (not (= ~d1_val_t~0 0))) (.cse16 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-01-06 19:22:28,696 INFO L185 CegarLoopUtils]: At program point L122-1(lines 95 124) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= ~d0_ev~0 1) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_is_method1_triggered_#res| 1) .cse11 .cse12 .cse13))) [2021-01-06 19:22:28,696 INFO L189 CegarLoopUtils]: For program point L189(lines 189 194) no Hoare annotation was computed. [2021-01-06 19:22:28,696 INFO L189 CegarLoopUtils]: For program point L189-2(lines 189 194) no Hoare annotation was computed. [2021-01-06 19:22:28,696 INFO L189 CegarLoopUtils]: For program point L189-3(lines 189 194) no Hoare annotation was computed. [2021-01-06 19:22:28,696 INFO L189 CegarLoopUtils]: For program point L189-5(lines 189 194) no Hoare annotation was computed. [2021-01-06 19:22:28,697 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 19:22:28,697 INFO L189 CegarLoopUtils]: For program point L356-1(lines 345 373) no Hoare annotation was computed. [2021-01-06 19:22:28,697 INFO L189 CegarLoopUtils]: For program point L323-1(lines 312 340) no Hoare annotation was computed. [2021-01-06 19:22:28,697 INFO L189 CegarLoopUtils]: For program point L356-3(lines 345 373) no Hoare annotation was computed. [2021-01-06 19:22:28,697 INFO L189 CegarLoopUtils]: For program point L323-3(lines 312 340) no Hoare annotation was computed. [2021-01-06 19:22:28,697 INFO L189 CegarLoopUtils]: For program point L291(lines 291 298) no Hoare annotation was computed. [2021-01-06 19:22:28,697 INFO L185 CegarLoopUtils]: At program point L225(lines 203 241) the Hoare annotation is: (let ((.cse16 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse17 (= ~d0_ev~0 0)) (.cse8 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= ~b1_ev~0 0)) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-01-06 19:22:28,698 INFO L185 CegarLoopUtils]: At program point L225-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-01-06 19:22:28,698 INFO L189 CegarLoopUtils]: For program point L159(lines 159 164) no Hoare annotation was computed. [2021-01-06 19:22:28,698 INFO L189 CegarLoopUtils]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2021-01-06 19:22:28,698 INFO L189 CegarLoopUtils]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2021-01-06 19:22:28,698 INFO L189 CegarLoopUtils]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2021-01-06 19:22:28,698 INFO L185 CegarLoopUtils]: At program point L424-1(lines 342 446) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2021-01-06 19:22:28,698 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 19:22:28,699 INFO L189 CegarLoopUtils]: For program point L425(line 425) no Hoare annotation was computed. [2021-01-06 19:22:28,699 INFO L189 CegarLoopUtils]: For program point L260(lines 260 265) no Hoare annotation was computed. [2021-01-06 19:22:28,699 INFO L189 CegarLoopUtils]: For program point L260-1(lines 260 265) no Hoare annotation was computed. [2021-01-06 19:22:28,699 INFO L189 CegarLoopUtils]: For program point L129(lines 129 134) no Hoare annotation was computed. [2021-01-06 19:22:28,699 INFO L189 CegarLoopUtils]: For program point L129-2(lines 129 134) no Hoare annotation was computed. [2021-01-06 19:22:28,699 INFO L189 CegarLoopUtils]: For program point L129-3(lines 129 134) no Hoare annotation was computed. [2021-01-06 19:22:28,699 INFO L189 CegarLoopUtils]: For program point L129-5(lines 129 134) no Hoare annotation was computed. [2021-01-06 19:22:28,699 INFO L192 CegarLoopUtils]: At program point L493(lines 493 499) the Hoare annotation is: true [2021-01-06 19:22:28,699 INFO L189 CegarLoopUtils]: For program point L361-1(lines 345 373) no Hoare annotation was computed. [2021-01-06 19:22:28,699 INFO L189 CegarLoopUtils]: For program point L328-1(lines 312 340) no Hoare annotation was computed. [2021-01-06 19:22:28,700 INFO L189 CegarLoopUtils]: For program point L361-3(lines 345 373) no Hoare annotation was computed. [2021-01-06 19:22:28,700 INFO L189 CegarLoopUtils]: For program point L328-3(lines 312 340) no Hoare annotation was computed. [2021-01-06 19:22:28,700 INFO L189 CegarLoopUtils]: For program point L65(lines 65 69) no Hoare annotation was computed. [2021-01-06 19:22:28,700 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 19:22:28,700 INFO L189 CegarLoopUtils]: For program point L65-2(lines 43 93) no Hoare annotation was computed. [2021-01-06 19:22:28,700 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-01-06 19:22:28,700 INFO L189 CegarLoopUtils]: For program point L99(lines 99 119) no Hoare annotation was computed. [2021-01-06 19:22:28,700 INFO L189 CegarLoopUtils]: For program point L99-1(lines 99 119) no Hoare annotation was computed. [2021-01-06 19:22:28,701 INFO L185 CegarLoopUtils]: At program point L232(lines 247 251) the Hoare annotation is: (let ((.cse16 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse17 (= ~d0_ev~0 0)) (.cse8 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= ~b1_ev~0 0)) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-01-06 19:22:28,701 INFO L185 CegarLoopUtils]: At program point L232-1(lines 200 242) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-01-06 19:22:28,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:22:28 BoogieIcfgContainer [2021-01-06 19:22:28,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:22:28,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:22:28,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:22:28,764 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:22:28,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:22:14" (3/4) ... [2021-01-06 19:22:28,769 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 19:22:28,793 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-01-06 19:22:28,794 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 19:22:28,795 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 19:22:28,795 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 19:22:28,835 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) [2021-01-06 19:22:28,838 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && !(\result == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) [2021-01-06 19:22:28,839 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) [2021-01-06 19:22:28,923 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/bist_cell.cil.c-witness.graphml [2021-01-06 19:22:28,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:22:28,925 INFO L168 Benchmark]: Toolchain (without parser) took 16354.26 ms. Allocated memory was 151.0 MB in the beginning and 404.8 MB in the end (delta: 253.8 MB). Free memory was 125.2 MB in the beginning and 379.1 MB in the end (delta: -253.9 MB). Peak memory consumption was 195.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:28,925 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 124.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:22:28,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.28 ms. Allocated memory is still 151.0 MB. Free memory was 125.2 MB in the beginning and 111.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:28,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.73 ms. Allocated memory is still 151.0 MB. Free memory was 111.6 MB in the beginning and 109.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:28,926 INFO L168 Benchmark]: Boogie Preprocessor took 69.16 ms. Allocated memory is still 151.0 MB. Free memory was 109.5 MB in the beginning and 107.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:28,927 INFO L168 Benchmark]: RCFGBuilder took 713.24 ms. Allocated memory is still 151.0 MB. Free memory was 107.4 MB in the beginning and 71.7 MB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:28,927 INFO L168 Benchmark]: TraceAbstraction took 14655.99 ms. Allocated memory was 151.0 MB in the beginning and 336.6 MB in the end (delta: 185.6 MB). Free memory was 71.7 MB in the beginning and 125.1 MB in the end (delta: -53.4 MB). Peak memory consumption was 141.7 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:28,928 INFO L168 Benchmark]: Witness Printer took 159.52 ms. Allocated memory was 336.6 MB in the beginning and 404.8 MB in the end (delta: 68.2 MB). Free memory was 125.1 MB in the beginning and 379.1 MB in the end (delta: -254.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:22:28,930 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 124.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 641.28 ms. Allocated memory is still 151.0 MB. Free memory was 125.2 MB in the beginning and 111.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 101.73 ms. Allocated memory is still 151.0 MB. Free memory was 111.6 MB in the beginning and 109.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 69.16 ms. Allocated memory is still 151.0 MB. Free memory was 109.5 MB in the beginning and 107.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 713.24 ms. Allocated memory is still 151.0 MB. Free memory was 107.4 MB in the beginning and 71.7 MB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14655.99 ms. Allocated memory was 151.0 MB in the beginning and 336.6 MB in the end (delta: 185.6 MB). Free memory was 71.7 MB in the beginning and 125.1 MB in the end (delta: -53.4 MB). Peak memory consumption was 141.7 MB. Max. memory is 8.0 GB. * Witness Printer took 159.52 ms. Allocated memory was 336.6 MB in the beginning and 404.8 MB in the end (delta: 68.2 MB). Free memory was 125.1 MB in the beginning and 379.1 MB in the end (delta: -254.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= b0_ev && d0_ev == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= b0_ev && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && d1_val_t == b0_val_t) && 2 <= b1_ev) && b0_val_t == 1) && 2 <= d0_ev) && b0_val == 0) && 1 == b1_req_up) && b1_val_t == b0_val_t) && d0_req_up == 1) && 0 == z_val_t) && d0_val_t == b0_val_t) && b0_req_up == 1) && 2 <= d1_ev - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((2 <= b0_ev && !(b1_val_t == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && !(1 == b1_req_up)) && z_val == 0) && !(b1_val == 0)) && 0 == z_val_t) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && b0_ev == 0) && 1 == b1_req_up) && !(d1_val_t == 0)) && d0_req_up == 1) && 0 == z_val_t) && 2 <= d1_ev - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && !(\result == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && 2 <= d1_ev)) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev)) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && 2 <= d1_ev) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && d0_req_up == 1) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev) || ((((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && d0_req_up == 1) && 0 == z_val_t) && 2 <= d1_ev) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && d0_ev == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.3s, OverallIterations: 29, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4787 SDtfs, 2771 SDslu, 4972 SDs, 0 SdLazy, 398 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 2015 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 3750 HoareAnnotationTreeSize, 33 FomulaSimplifications, 39368 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 33 FomulaSimplificationsInter, 14097 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2890 NumberOfCodeBlocks, 2890 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2856 ConstructedInterpolants, 0 QuantifiedInterpolants, 458837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 114/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...