./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:00:34,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:00:34,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:00:34,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:00:34,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:00:34,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:00:34,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:00:34,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:00:34,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:00:34,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:00:34,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:00:34,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:00:34,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:00:34,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:00:34,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:00:34,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:00:34,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:00:34,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:00:34,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:00:34,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:00:34,057 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:00:34,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:00:34,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:00:34,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:00:34,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:00:34,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:00:34,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:00:34,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:00:34,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:00:34,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:00:34,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:00:34,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:00:34,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:00:34,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:00:34,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:00:34,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:00:34,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:00:34,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:00:34,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:00:34,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:00:34,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:00:34,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:00:34,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:00:34,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:00:34,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:00:34,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:00:34,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:00:34,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:00:34,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:00:34,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:00:34,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:00:34,100 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:00:34,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:00:34,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:00:34,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:00:34,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:00:34,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:00:34,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:00:34,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:00:34,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:00:34,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:00:34,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:00:34,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:00:34,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:00:34,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:00:34,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:00:34,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:00:34,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:00:34,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:00:34,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:00:34,105 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:00:34,105 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:00:34,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:00:34,106 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 [2022-07-12 11:00:34,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:00:34,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:00:34,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:00:34,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:00:34,374 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:00:34,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i [2022-07-12 11:00:34,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fcf594b/264628213be04f07b318b75d793383b3/FLAG695a2b880 [2022-07-12 11:00:35,167 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:00:35,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i [2022-07-12 11:00:35,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fcf594b/264628213be04f07b318b75d793383b3/FLAG695a2b880 [2022-07-12 11:00:35,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fcf594b/264628213be04f07b318b75d793383b3 [2022-07-12 11:00:35,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:00:35,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:00:35,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:00:35,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:00:35,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:00:35,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:00:35" (1/1) ... [2022-07-12 11:00:35,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6f16eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:35, skipping insertion in model container [2022-07-12 11:00:35,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:00:35" (1/1) ... [2022-07-12 11:00:35,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:00:35,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:00:35,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i[4497,4510] [2022-07-12 11:00:35,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i[4557,4570] [2022-07-12 11:00:36,540 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:36,541 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:36,541 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:36,542 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:36,543 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:36,555 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:36,556 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:36,557 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:36,558 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:36,865 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:00:36,866 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:00:36,867 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:00:36,868 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:00:36,871 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:00:36,875 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:00:36,876 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:00:36,876 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:00:36,878 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:00:36,880 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:00:37,034 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:00:37,103 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,103 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:00:37,215 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:00:37,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i[4497,4510] [2022-07-12 11:00:37,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i[4557,4570] [2022-07-12 11:00:37,282 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,282 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,283 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,284 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,285 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,300 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,301 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,302 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,304 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,348 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:00:37,349 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:00:37,350 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:00:37,380 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:00:37,381 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:00:37,381 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:00:37,382 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:00:37,383 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:00:37,383 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:00:37,383 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:00:37,402 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:00:37,462 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,462 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:37,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:00:37,690 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:00:37,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37 WrapperNode [2022-07-12 11:00:37,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:00:37,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:00:37,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:00:37,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:00:37,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (1/1) ... [2022-07-12 11:00:37,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (1/1) ... [2022-07-12 11:00:37,922 INFO L137 Inliner]: procedures = 690, calls = 2642, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 882 [2022-07-12 11:00:37,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:00:37,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:00:37,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:00:37,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:00:37,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (1/1) ... [2022-07-12 11:00:37,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (1/1) ... [2022-07-12 11:00:37,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (1/1) ... [2022-07-12 11:00:37,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (1/1) ... [2022-07-12 11:00:37,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (1/1) ... [2022-07-12 11:00:37,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (1/1) ... [2022-07-12 11:00:37,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (1/1) ... [2022-07-12 11:00:38,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:00:38,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:00:38,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:00:38,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:00:38,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (1/1) ... [2022-07-12 11:00:38,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:00:38,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:38,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 11:00:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-12 11:00:38,100 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-12 11:00:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:00:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:00:38,101 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:00:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:00:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:00:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:00:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:00:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:00:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:00:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:00:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:00:38,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 11:00:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:00:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:00:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-12 11:00:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-12 11:00:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:00:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:00:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:00:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:00:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:00:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:00:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:00:38,371 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:00:38,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:00:39,399 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:00:39,405 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:00:39,405 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 11:00:39,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:00:39 BoogieIcfgContainer [2022-07-12 11:00:39,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:00:39,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:00:39,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:00:39,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:00:39,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:00:35" (1/3) ... [2022-07-12 11:00:39,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362af296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:00:39, skipping insertion in model container [2022-07-12 11:00:39,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:37" (2/3) ... [2022-07-12 11:00:39,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362af296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:00:39, skipping insertion in model container [2022-07-12 11:00:39,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:00:39" (3/3) ... [2022-07-12 11:00:39,415 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_advance_harness.i [2022-07-12 11:00:39,427 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:00:39,428 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:00:39,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:00:39,474 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d626fe7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38190523 [2022-07-12 11:00:39,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:00:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-12 11:00:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 11:00:39,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:39,488 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-12 11:00:39,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1865164224, now seen corresponding path program 1 times [2022-07-12 11:00:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:39,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923927430] [2022-07-12 11:00:39,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:39,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:00:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:00:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:00:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:00:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:00:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 11:00:40,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:40,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923927430] [2022-07-12 11:00:40,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923927430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:40,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:00:40,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:00:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88579868] [2022-07-12 11:00:40,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:40,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 11:00:40,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:40,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 11:00:40,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 11:00:40,190 INFO L87 Difference]: Start difference. First operand has 90 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 11:00:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:40,238 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2022-07-12 11:00:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 11:00:40,240 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-07-12 11:00:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:40,250 INFO L225 Difference]: With dead ends: 170 [2022-07-12 11:00:40,250 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 11:00:40,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 11:00:40,265 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:40,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:00:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 11:00:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-12 11:00:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-12 11:00:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2022-07-12 11:00:40,309 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 47 [2022-07-12 11:00:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:40,310 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2022-07-12 11:00:40,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 11:00:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-07-12 11:00:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 11:00:40,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:40,313 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-12 11:00:40,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:00:40,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:40,314 INFO L85 PathProgramCache]: Analyzing trace with hash 866728124, now seen corresponding path program 1 times [2022-07-12 11:00:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:40,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013435217] [2022-07-12 11:00:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:40,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:00:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:00:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:00:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:00:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:00:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 11:00:40,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:40,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013435217] [2022-07-12 11:00:40,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013435217] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:40,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472135530] [2022-07-12 11:00:40,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:40,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:40,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:40,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:40,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:00:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:41,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 2490 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:00:41,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 11:00:41,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:00:41,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472135530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:41,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:00:41,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-07-12 11:00:41,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501049624] [2022-07-12 11:00:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:41,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:00:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:41,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:00:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:00:41,315 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 11:00:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:41,505 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2022-07-12 11:00:41,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:00:41,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-07-12 11:00:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:41,508 INFO L225 Difference]: With dead ends: 146 [2022-07-12 11:00:41,509 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 11:00:41,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:00:41,511 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 128 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:41,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 258 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:00:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 11:00:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-12 11:00:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-07-12 11:00:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2022-07-12 11:00:41,530 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 47 [2022-07-12 11:00:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:41,530 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2022-07-12 11:00:41,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 11:00:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2022-07-12 11:00:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 11:00:41,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:41,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-12 11:00:41,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:41,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:41,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash -912055711, now seen corresponding path program 1 times [2022-07-12 11:00:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:41,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374374836] [2022-07-12 11:00:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:41,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:00:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:41,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:00:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:00:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:00:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:41,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:00:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 11:00:41,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:41,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374374836] [2022-07-12 11:00:41,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374374836] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:41,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106566970] [2022-07-12 11:00:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:41,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:41,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:41,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:41,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:00:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:42,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 2495 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:00:42,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 11:00:42,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:00:42,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106566970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:42,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:00:42,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-07-12 11:00:42,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994731551] [2022-07-12 11:00:42,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:42,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:00:42,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:42,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:00:42,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:00:42,581 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 11:00:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:42,751 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2022-07-12 11:00:42,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:00:42,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2022-07-12 11:00:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:42,753 INFO L225 Difference]: With dead ends: 141 [2022-07-12 11:00:42,753 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 11:00:42,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:00:42,755 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 145 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:42,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 251 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:00:42,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 11:00:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-12 11:00:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-07-12 11:00:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2022-07-12 11:00:42,763 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 49 [2022-07-12 11:00:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:42,764 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2022-07-12 11:00:42,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 11:00:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2022-07-12 11:00:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 11:00:42,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:42,765 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-07-12 11:00:42,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:42,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 11:00:42,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:42,992 INFO L85 PathProgramCache]: Analyzing trace with hash -633300053, now seen corresponding path program 1 times [2022-07-12 11:00:42,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:42,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699805466] [2022-07-12 11:00:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:43,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:43,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:00:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:43,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:00:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:00:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:00:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:43,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:00:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 11:00:43,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:43,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699805466] [2022-07-12 11:00:43,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699805466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:43,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:00:43,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:00:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483794376] [2022-07-12 11:00:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:43,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:00:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:43,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:00:43,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:00:43,361 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 11:00:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:43,447 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-07-12 11:00:43,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:00:43,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2022-07-12 11:00:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:43,449 INFO L225 Difference]: With dead ends: 95 [2022-07-12 11:00:43,450 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 11:00:43,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:00:43,451 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 16 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:43,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 691 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:00:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 11:00:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-07-12 11:00:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 60 states have (on average 1.2) internal successors, (72), 64 states have internal predecessors, (72), 23 states have call successors, (23), 7 states have call predecessors, (23), 8 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2022-07-12 11:00:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2022-07-12 11:00:43,461 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 53 [2022-07-12 11:00:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:43,462 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2022-07-12 11:00:43,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 11:00:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2022-07-12 11:00:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 11:00:43,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:43,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-07-12 11:00:43,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:00:43,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:43,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1847539699, now seen corresponding path program 1 times [2022-07-12 11:00:43,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:43,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885916359] [2022-07-12 11:00:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:43,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:43,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:43,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:00:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:44,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:00:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:44,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:00:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:00:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:44,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:00:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 11:00:44,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:44,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885916359] [2022-07-12 11:00:44,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885916359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:44,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003113046] [2022-07-12 11:00:44,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:44,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:44,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:44,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:44,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:00:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:44,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 2517 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 11:00:44,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:44,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:00:45,289 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 11:00:45,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-12 11:00:45,411 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 11:00:45,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 11:00:45,869 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 11:00:45,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:00:45,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:00:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:00:46,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:00:46,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_270) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (<= .cse0 (* 18446744073709551616 (div .cse0 18446744073709551616))))) is different from false [2022-07-12 11:00:46,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003113046] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:46,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:00:46,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2022-07-12 11:00:46,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101977780] [2022-07-12 11:00:46,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:00:46,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 11:00:46,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:46,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 11:00:46,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1107, Unknown=1, NotChecked=68, Total=1332 [2022-07-12 11:00:46,540 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-12 11:00:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:47,996 INFO L93 Difference]: Finished difference Result 261 states and 360 transitions. [2022-07-12 11:00:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 11:00:47,996 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) Word has length 57 [2022-07-12 11:00:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:47,999 INFO L225 Difference]: With dead ends: 261 [2022-07-12 11:00:47,999 INFO L226 Difference]: Without dead ends: 196 [2022-07-12 11:00:48,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=299, Invalid=2154, Unknown=1, NotChecked=96, Total=2550 [2022-07-12 11:00:48,001 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 127 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 465 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:48,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1140 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 826 Invalid, 0 Unknown, 465 Unchecked, 0.9s Time] [2022-07-12 11:00:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-12 11:00:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 156. [2022-07-12 11:00:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 111 states have internal predecessors, (132), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (42), 31 states have call predecessors, (42), 31 states have call successors, (42) [2022-07-12 11:00:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 208 transitions. [2022-07-12 11:00:48,028 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 208 transitions. Word has length 57 [2022-07-12 11:00:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:48,028 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 208 transitions. [2022-07-12 11:00:48,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-12 11:00:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 208 transitions. [2022-07-12 11:00:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 11:00:48,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:48,030 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-07-12 11:00:48,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:48,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:48,256 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:48,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:48,256 INFO L85 PathProgramCache]: Analyzing trace with hash 259191797, now seen corresponding path program 1 times [2022-07-12 11:00:48,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:48,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892976954] [2022-07-12 11:00:48,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:48,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:00:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:00:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:00:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:00:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:00:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 11:00:49,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:49,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892976954] [2022-07-12 11:00:49,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892976954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:49,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578652151] [2022-07-12 11:00:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:49,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:49,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:49,017 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:49,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:00:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:55,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 2547 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-12 11:00:55,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:55,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:00:55,571 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 11:00:55,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-12 11:00:55,668 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 11:00:55,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 11:00:56,081 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 11:00:56,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:00:56,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-07-12 11:00:56,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:00:56,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-07-12 11:00:56,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:00:56,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2022-07-12 11:00:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:00:57,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:00:57,283 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:00:57,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-12 11:00:57,292 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| Int)) (or (not (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|) |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1|)) (<= |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1| (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (+ (* (div (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1| (* (- 1) .cse0)) 18446744073709551616) 18446744073709551616) .cse0))))) |c_ULTIMATE.start_aws_byte_cursor_advance_#t~short1082#1|) is different from false [2022-07-12 11:00:57,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|))) (or (< (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|) 18446744073709551616) (mod .cse0 18446744073709551616)) (<= .cse0 (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (+ (* 18446744073709551616 (div (+ .cse0 (* (- 1) .cse1)) 18446744073709551616)) .cse1)))))) is different from false [2022-07-12 11:00:57,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578652151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:57,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:00:57,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2022-07-12 11:00:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400058211] [2022-07-12 11:00:57,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:00:57,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 11:00:57,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:57,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 11:00:57,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1122, Unknown=2, NotChecked=138, Total=1406 [2022-07-12 11:00:57,443 INFO L87 Difference]: Start difference. First operand 156 states and 208 transitions. Second operand has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-12 11:01:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:00,113 INFO L93 Difference]: Finished difference Result 313 states and 449 transitions. [2022-07-12 11:01:00,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 11:01:00,114 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) Word has length 57 [2022-07-12 11:01:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:00,116 INFO L225 Difference]: With dead ends: 313 [2022-07-12 11:01:00,116 INFO L226 Difference]: Without dead ends: 244 [2022-07-12 11:01:00,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=292, Invalid=2470, Unknown=2, NotChecked=206, Total=2970 [2022-07-12 11:01:00,118 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 125 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:00,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1642 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1035 Invalid, 0 Unknown, 457 Unchecked, 1.4s Time] [2022-07-12 11:01:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-12 11:01:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 170. [2022-07-12 11:01:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 118 states have (on average 1.228813559322034) internal successors, (145), 121 states have internal predecessors, (145), 38 states have call successors, (38), 14 states have call predecessors, (38), 13 states have return successors, (47), 34 states have call predecessors, (47), 35 states have call successors, (47) [2022-07-12 11:01:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2022-07-12 11:01:00,144 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 57 [2022-07-12 11:01:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:00,144 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2022-07-12 11:01:00,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-12 11:01:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2022-07-12 11:01:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 11:01:00,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:00,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:00,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:00,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:00,371 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:00,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1565075525, now seen corresponding path program 2 times [2022-07-12 11:01:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:00,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304364883] [2022-07-12 11:01:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:01:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:01:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 11:01:00,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:00,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304364883] [2022-07-12 11:01:00,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304364883] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:00,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004478049] [2022-07-12 11:01:00,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:01:00,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:00,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:00,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:00,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:01:01,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:01:01,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:01:01,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:01:01,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 11:01:01,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:01,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004478049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:01,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:01,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2022-07-12 11:01:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153549759] [2022-07-12 11:01:01,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:01,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:01:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:01,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:01:01,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:01:01,609 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 11:01:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:01,726 INFO L93 Difference]: Finished difference Result 238 states and 327 transitions. [2022-07-12 11:01:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:01:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 61 [2022-07-12 11:01:01,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:01,733 INFO L225 Difference]: With dead ends: 238 [2022-07-12 11:01:01,734 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 11:01:01,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:01:01,735 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:01,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 779 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 11:01:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-07-12 11:01:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 118 states have (on average 1.2203389830508475) internal successors, (144), 121 states have internal predecessors, (144), 38 states have call successors, (38), 14 states have call predecessors, (38), 13 states have return successors, (51), 34 states have call predecessors, (51), 35 states have call successors, (51) [2022-07-12 11:01:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2022-07-12 11:01:01,770 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 61 [2022-07-12 11:01:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:01,770 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2022-07-12 11:01:01,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 11:01:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2022-07-12 11:01:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 11:01:01,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:01,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 11:01:01,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:01,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:01,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1300919918, now seen corresponding path program 1 times [2022-07-12 11:01:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:01,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521013536] [2022-07-12 11:01:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 11:01:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:01:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 11:01:02,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:02,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521013536] [2022-07-12 11:01:02,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521013536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:02,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:02,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:01:02,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555034941] [2022-07-12 11:01:02,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:02,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:01:02,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:02,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:01:02,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:01:02,336 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 11:01:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:02,552 INFO L93 Difference]: Finished difference Result 288 states and 411 transitions. [2022-07-12 11:01:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:01:02,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-07-12 11:01:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:02,555 INFO L225 Difference]: With dead ends: 288 [2022-07-12 11:01:02,555 INFO L226 Difference]: Without dead ends: 199 [2022-07-12 11:01:02,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:01:02,556 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 38 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:02,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 391 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-12 11:01:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 162. [2022-07-12 11:01:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 113 states have (on average 1.2123893805309736) internal successors, (137), 115 states have internal predecessors, (137), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (47), 32 states have call predecessors, (47), 32 states have call successors, (47) [2022-07-12 11:01:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 219 transitions. [2022-07-12 11:01:02,573 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 219 transitions. Word has length 64 [2022-07-12 11:01:02,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:02,573 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 219 transitions. [2022-07-12 11:01:02,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 11:01:02,574 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 219 transitions. [2022-07-12 11:01:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 11:01:02,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:02,575 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:02,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:01:02,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:02,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash -145583488, now seen corresponding path program 1 times [2022-07-12 11:01:02,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:02,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509281332] [2022-07-12 11:01:02,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:01:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 11:01:02,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:02,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509281332] [2022-07-12 11:01:02,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509281332] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:02,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096614176] [2022-07-12 11:01:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:02,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:02,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:02,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:02,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 11:01:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:03,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 2534 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:01:03,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 11:01:03,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:03,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096614176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:03,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:03,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-07-12 11:01:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483457675] [2022-07-12 11:01:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:03,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:01:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:01:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:01:03,300 INFO L87 Difference]: Start difference. First operand 162 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 11:01:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:03,488 INFO L93 Difference]: Finished difference Result 258 states and 361 transitions. [2022-07-12 11:01:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:01:03,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2022-07-12 11:01:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:03,490 INFO L225 Difference]: With dead ends: 258 [2022-07-12 11:01:03,490 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 11:01:03,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:01:03,491 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 17 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:03,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 328 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2022-07-12 11:01:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 11:01:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-12 11:01:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 115 states have internal predecessors, (136), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (47), 32 states have call predecessors, (47), 32 states have call successors, (47) [2022-07-12 11:01:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 218 transitions. [2022-07-12 11:01:03,508 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 218 transitions. Word has length 63 [2022-07-12 11:01:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:03,508 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 218 transitions. [2022-07-12 11:01:03,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 11:01:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 218 transitions. [2022-07-12 11:01:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 11:01:03,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:03,510 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:03,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:03,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:03,724 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:03,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash 556016386, now seen corresponding path program 1 times [2022-07-12 11:01:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:03,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475605665] [2022-07-12 11:01:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:04,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:04,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:01:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:04,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 11:01:04,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475605665] [2022-07-12 11:01:04,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475605665] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117638965] [2022-07-12 11:01:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:04,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:04,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:04,511 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:04,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:01:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:04,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 2539 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 11:01:04,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:04,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:01:05,360 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 11:01:05,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 1 [2022-07-12 11:01:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:01:05,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 11:01:05,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117638965] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:01:05,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:01:05,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2022-07-12 11:01:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249148557] [2022-07-12 11:01:05,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:05,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 11:01:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 11:01:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2022-07-12 11:01:05,720 INFO L87 Difference]: Start difference. First operand 162 states and 218 transitions. Second operand has 30 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 30 states have internal predecessors, (104), 9 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-12 11:01:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:08,798 INFO L93 Difference]: Finished difference Result 353 states and 501 transitions. [2022-07-12 11:01:08,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 11:01:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 30 states have internal predecessors, (104), 9 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) Word has length 63 [2022-07-12 11:01:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:08,802 INFO L225 Difference]: With dead ends: 353 [2022-07-12 11:01:08,802 INFO L226 Difference]: Without dead ends: 245 [2022-07-12 11:01:08,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=513, Invalid=2909, Unknown=0, NotChecked=0, Total=3422 [2022-07-12 11:01:08,805 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 270 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:08,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1079 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1934 Invalid, 0 Unknown, 367 Unchecked, 1.8s Time] [2022-07-12 11:01:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-12 11:01:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 161. [2022-07-12 11:01:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (45), 32 states have call predecessors, (45), 32 states have call successors, (45) [2022-07-12 11:01:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2022-07-12 11:01:08,824 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 63 [2022-07-12 11:01:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:08,825 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2022-07-12 11:01:08,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 30 states have internal predecessors, (104), 9 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-12 11:01:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2022-07-12 11:01:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 11:01:08,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:08,826 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2022-07-12 11:01:08,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:09,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:09,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:09,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1118956732, now seen corresponding path program 1 times [2022-07-12 11:01:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:09,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578195417] [2022-07-12 11:01:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:01:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 11:01:09,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:09,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578195417] [2022-07-12 11:01:09,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578195417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:09,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:09,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:01:09,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960687080] [2022-07-12 11:01:09,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:09,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:01:09,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:01:09,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:01:09,259 INFO L87 Difference]: Start difference. First operand 161 states and 210 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 11:01:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:09,320 INFO L93 Difference]: Finished difference Result 216 states and 277 transitions. [2022-07-12 11:01:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:01:09,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2022-07-12 11:01:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:09,322 INFO L225 Difference]: With dead ends: 216 [2022-07-12 11:01:09,322 INFO L226 Difference]: Without dead ends: 161 [2022-07-12 11:01:09,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:01:09,324 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:09,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 362 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:01:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-12 11:01:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-12 11:01:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2022-07-12 11:01:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 209 transitions. [2022-07-12 11:01:09,340 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 209 transitions. Word has length 65 [2022-07-12 11:01:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:09,341 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 209 transitions. [2022-07-12 11:01:09,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 11:01:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 209 transitions. [2022-07-12 11:01:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 11:01:09,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:09,342 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2022-07-12 11:01:09,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 11:01:09,343 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:09,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1635963807, now seen corresponding path program 1 times [2022-07-12 11:01:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:09,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608970750] [2022-07-12 11:01:09,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:09,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:01:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 11:01:09,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:09,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608970750] [2022-07-12 11:01:09,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608970750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:09,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:09,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:01:09,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085426128] [2022-07-12 11:01:09,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:09,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:01:09,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:09,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:01:09,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:01:09,569 INFO L87 Difference]: Start difference. First operand 161 states and 209 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 11:01:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:09,659 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2022-07-12 11:01:09,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:01:09,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 67 [2022-07-12 11:01:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:09,662 INFO L225 Difference]: With dead ends: 169 [2022-07-12 11:01:09,662 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 11:01:09,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:01:09,663 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 15 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:09,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 683 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:01:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 11:01:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2022-07-12 11:01:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 117 states have internal predecessors, (133), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (45), 33 states have call predecessors, (45), 33 states have call successors, (45) [2022-07-12 11:01:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2022-07-12 11:01:09,680 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 67 [2022-07-12 11:01:09,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:09,681 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2022-07-12 11:01:09,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 11:01:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2022-07-12 11:01:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 11:01:09,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:09,683 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 11:01:09,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 11:01:09,683 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash 701340153, now seen corresponding path program 1 times [2022-07-12 11:01:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:09,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674800333] [2022-07-12 11:01:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:09,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:10,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:01:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:01:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:01:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:10,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:10,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:01:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:01:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 11:01:10,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:10,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674800333] [2022-07-12 11:01:10,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674800333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:10,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416893139] [2022-07-12 11:01:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:10,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:10,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:10,244 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:10,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 11:01:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:10,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 2554 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 11:01:10,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:10,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:01:10,874 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:01:10,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:01:10,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:01:11,241 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-12 11:01:11,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-07-12 11:01:11,304 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:01:11,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:01:11,587 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:01:11,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 11:01:11,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 11:01:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 11:01:22,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:22,488 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_778) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset| 8)) 0))) is different from false [2022-07-12 11:01:22,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416893139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:22,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:01:22,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2022-07-12 11:01:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960106812] [2022-07-12 11:01:22,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:22,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 11:01:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 11:01:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=4, NotChecked=76, Total=1640 [2022-07-12 11:01:22,558 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 12 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-12 11:01:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:34,489 INFO L93 Difference]: Finished difference Result 400 states and 570 transitions. [2022-07-12 11:01:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 11:01:34,490 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 12 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) Word has length 68 [2022-07-12 11:01:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:34,492 INFO L225 Difference]: With dead ends: 400 [2022-07-12 11:01:34,492 INFO L226 Difference]: Without dead ends: 331 [2022-07-12 11:01:34,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 84 SyntacticMatches, 13 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=787, Invalid=6692, Unknown=7, NotChecked=170, Total=7656 [2022-07-12 11:01:34,496 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 347 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1407 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:34,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 646 Invalid, 4464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2618 Invalid, 0 Unknown, 1407 Unchecked, 2.2s Time] [2022-07-12 11:01:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-12 11:01:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 191. [2022-07-12 11:01:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 135 states have (on average 1.162962962962963) internal successors, (157), 138 states have internal predecessors, (157), 37 states have call successors, (37), 19 states have call predecessors, (37), 18 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2022-07-12 11:01:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 241 transitions. [2022-07-12 11:01:34,521 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 241 transitions. Word has length 68 [2022-07-12 11:01:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:34,521 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 241 transitions. [2022-07-12 11:01:34,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 12 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-12 11:01:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2022-07-12 11:01:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 11:01:34,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:34,522 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2022-07-12 11:01:34,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 11:01:34,736 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:34,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1153679959, now seen corresponding path program 1 times [2022-07-12 11:01:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:34,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565954543] [2022-07-12 11:01:34,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:01:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 11:01:34,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:34,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565954543] [2022-07-12 11:01:34,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565954543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:34,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:34,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:01:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455452826] [2022-07-12 11:01:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:34,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:01:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:01:34,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:01:34,981 INFO L87 Difference]: Start difference. First operand 191 states and 241 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 11:01:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:35,213 INFO L93 Difference]: Finished difference Result 254 states and 326 transitions. [2022-07-12 11:01:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:01:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-07-12 11:01:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:35,215 INFO L225 Difference]: With dead ends: 254 [2022-07-12 11:01:35,215 INFO L226 Difference]: Without dead ends: 199 [2022-07-12 11:01:35,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:01:35,217 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 40 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:35,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 375 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:01:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-12 11:01:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2022-07-12 11:01:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 136 states have (on average 1.161764705882353) internal successors, (158), 141 states have internal predecessors, (158), 42 states have call successors, (42), 19 states have call predecessors, (42), 18 states have return successors, (54), 36 states have call predecessors, (54), 39 states have call successors, (54) [2022-07-12 11:01:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 254 transitions. [2022-07-12 11:01:35,241 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 254 transitions. Word has length 71 [2022-07-12 11:01:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:35,241 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 254 transitions. [2022-07-12 11:01:35,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 11:01:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 254 transitions. [2022-07-12 11:01:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 11:01:35,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:35,244 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2022-07-12 11:01:35,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 11:01:35,244 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -452080085, now seen corresponding path program 1 times [2022-07-12 11:01:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:35,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459657770] [2022-07-12 11:01:35,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:35,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:01:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 11:01:35,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:35,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459657770] [2022-07-12 11:01:35,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459657770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:35,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900382482] [2022-07-12 11:01:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:35,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:35,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:35,830 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:35,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 11:01:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 11:01:36,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:36,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:01:36,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:01:36,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 36 [2022-07-12 11:01:36,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 11:01:36,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 11:01:36,888 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:01:36,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2022-07-12 11:01:36,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-07-12 11:01:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 11:01:37,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:37,827 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:01:37,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2022-07-12 11:01:37,832 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:01:37,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-07-12 11:01:37,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-07-12 11:01:37,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:01:37,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-07-12 11:01:38,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-12 11:01:38,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-12 11:01:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 11:01:38,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900382482] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:01:38,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:01:38,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 37 [2022-07-12 11:01:38,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916433851] [2022-07-12 11:01:38,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:38,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 11:01:38,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 11:01:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 11:01:38,231 INFO L87 Difference]: Start difference. First operand 197 states and 254 transitions. Second operand has 37 states, 33 states have (on average 2.787878787878788) internal successors, (92), 36 states have internal predecessors, (92), 15 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 10 states have call predecessors, (22), 14 states have call successors, (22) [2022-07-12 11:01:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:42,210 INFO L93 Difference]: Finished difference Result 391 states and 540 transitions. [2022-07-12 11:01:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 11:01:42,210 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 2.787878787878788) internal successors, (92), 36 states have internal predecessors, (92), 15 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 10 states have call predecessors, (22), 14 states have call successors, (22) Word has length 71 [2022-07-12 11:01:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:42,212 INFO L225 Difference]: With dead ends: 391 [2022-07-12 11:01:42,212 INFO L226 Difference]: Without dead ends: 315 [2022-07-12 11:01:42,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 135 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=582, Invalid=5118, Unknown=0, NotChecked=0, Total=5700 [2022-07-12 11:01:42,214 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 253 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 549 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:42,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 2394 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2381 Invalid, 0 Unknown, 549 Unchecked, 2.1s Time] [2022-07-12 11:01:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-12 11:01:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 229. [2022-07-12 11:01:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 156 states have (on average 1.1666666666666667) internal successors, (182), 165 states have internal predecessors, (182), 51 states have call successors, (51), 21 states have call predecessors, (51), 21 states have return successors, (65), 42 states have call predecessors, (65), 48 states have call successors, (65) [2022-07-12 11:01:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 298 transitions. [2022-07-12 11:01:42,249 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 298 transitions. Word has length 71 [2022-07-12 11:01:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:42,249 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 298 transitions. [2022-07-12 11:01:42,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 2.787878787878788) internal successors, (92), 36 states have internal predecessors, (92), 15 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 10 states have call predecessors, (22), 14 states have call successors, (22) [2022-07-12 11:01:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 298 transitions. [2022-07-12 11:01:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 11:01:42,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:42,251 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:42,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 11:01:42,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 11:01:42,471 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1701555945, now seen corresponding path program 1 times [2022-07-12 11:01:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:42,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662118666] [2022-07-12 11:01:42,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:42,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:01:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 11:01:42,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:42,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662118666] [2022-07-12 11:01:42,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662118666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:42,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:42,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:01:42,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546874041] [2022-07-12 11:01:42,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:42,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:01:42,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:42,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:01:42,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:01:42,693 INFO L87 Difference]: Start difference. First operand 229 states and 298 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:01:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:42,739 INFO L93 Difference]: Finished difference Result 255 states and 331 transitions. [2022-07-12 11:01:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:01:42,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2022-07-12 11:01:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:42,741 INFO L225 Difference]: With dead ends: 255 [2022-07-12 11:01:42,742 INFO L226 Difference]: Without dead ends: 226 [2022-07-12 11:01:42,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:01:42,743 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 27 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:42,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 257 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:01:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-12 11:01:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2022-07-12 11:01:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 151 states have (on average 1.1655629139072847) internal successors, (176), 160 states have internal predecessors, (176), 49 states have call successors, (49), 20 states have call predecessors, (49), 20 states have return successors, (62), 40 states have call predecessors, (62), 46 states have call successors, (62) [2022-07-12 11:01:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 287 transitions. [2022-07-12 11:01:42,777 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 287 transitions. Word has length 80 [2022-07-12 11:01:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:42,778 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 287 transitions. [2022-07-12 11:01:42,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 11:01:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 287 transitions. [2022-07-12 11:01:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 11:01:42,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:42,783 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:42,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 11:01:42,783 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1390033412, now seen corresponding path program 1 times [2022-07-12 11:01:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:42,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429854137] [2022-07-12 11:01:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:42,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:01:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 11:01:43,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:43,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429854137] [2022-07-12 11:01:43,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429854137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:43,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:43,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:01:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461653636] [2022-07-12 11:01:43,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:43,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:01:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:43,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:01:43,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:01:43,002 INFO L87 Difference]: Start difference. First operand 221 states and 287 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 11:01:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:43,086 INFO L93 Difference]: Finished difference Result 229 states and 295 transitions. [2022-07-12 11:01:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:01:43,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2022-07-12 11:01:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:43,088 INFO L225 Difference]: With dead ends: 229 [2022-07-12 11:01:43,088 INFO L226 Difference]: Without dead ends: 227 [2022-07-12 11:01:43,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:01:43,089 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 15 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:43,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 670 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:01:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-12 11:01:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2022-07-12 11:01:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 154 states have (on average 1.1623376623376624) internal successors, (179), 163 states have internal predecessors, (179), 50 states have call successors, (50), 21 states have call predecessors, (50), 21 states have return successors, (63), 41 states have call predecessors, (63), 47 states have call successors, (63) [2022-07-12 11:01:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 292 transitions. [2022-07-12 11:01:43,119 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 292 transitions. Word has length 82 [2022-07-12 11:01:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:43,119 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 292 transitions. [2022-07-12 11:01:43,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 11:01:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 292 transitions. [2022-07-12 11:01:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 11:01:43,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:43,121 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:43,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 11:01:43,122 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1172549180, now seen corresponding path program 1 times [2022-07-12 11:01:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:43,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104216676] [2022-07-12 11:01:43,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:43,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:01:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 11:01:43,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104216676] [2022-07-12 11:01:43,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104216676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:43,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:43,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:01:43,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607401877] [2022-07-12 11:01:43,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:43,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:01:43,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:43,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:01:43,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:01:43,384 INFO L87 Difference]: Start difference. First operand 226 states and 292 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 11:01:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:43,694 INFO L93 Difference]: Finished difference Result 276 states and 363 transitions. [2022-07-12 11:01:43,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:01:43,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2022-07-12 11:01:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:43,702 INFO L225 Difference]: With dead ends: 276 [2022-07-12 11:01:43,702 INFO L226 Difference]: Without dead ends: 250 [2022-07-12 11:01:43,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:01:43,703 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 65 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:43,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 596 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:01:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-12 11:01:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 233. [2022-07-12 11:01:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 157 states have (on average 1.1592356687898089) internal successors, (182), 166 states have internal predecessors, (182), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (67), 45 states have call predecessors, (67), 51 states have call successors, (67) [2022-07-12 11:01:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 303 transitions. [2022-07-12 11:01:43,738 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 303 transitions. Word has length 86 [2022-07-12 11:01:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:43,739 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 303 transitions. [2022-07-12 11:01:43,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 11:01:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 303 transitions. [2022-07-12 11:01:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 11:01:43,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:43,741 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:43,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 11:01:43,741 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:43,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:43,741 INFO L85 PathProgramCache]: Analyzing trace with hash 755723522, now seen corresponding path program 1 times [2022-07-12 11:01:43,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:43,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649662229] [2022-07-12 11:01:43,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:43,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:01:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:01:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:01:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:01:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:01:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:01:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:43,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 11:01:44,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:44,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649662229] [2022-07-12 11:01:44,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649662229] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:44,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994533315] [2022-07-12 11:01:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:44,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:44,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:44,161 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:44,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 11:01:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:49,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 11:01:49,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:49,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:01:49,685 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 11:01:49,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-12 11:01:49,744 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 11:01:49,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 11:01:49,968 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 11:01:49,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:01:50,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 11:01:50,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:01:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 35 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 11:01:50,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 11:01:50,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994533315] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:01:50,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:01:50,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 11] total 31 [2022-07-12 11:01:50,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163374338] [2022-07-12 11:01:50,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:50,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 11:01:50,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 11:01:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2022-07-12 11:01:50,806 INFO L87 Difference]: Start difference. First operand 233 states and 303 transitions. Second operand has 31 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 28 states have internal predecessors, (102), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-12 11:01:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:51,685 INFO L93 Difference]: Finished difference Result 331 states and 433 transitions. [2022-07-12 11:01:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 11:01:51,686 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 28 states have internal predecessors, (102), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) Word has length 86 [2022-07-12 11:01:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:51,688 INFO L225 Difference]: With dead ends: 331 [2022-07-12 11:01:51,688 INFO L226 Difference]: Without dead ends: 297 [2022-07-12 11:01:51,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 163 SyntacticMatches, 16 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=1506, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 11:01:51,690 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 135 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 470 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:51,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1440 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 550 Invalid, 0 Unknown, 470 Unchecked, 0.5s Time] [2022-07-12 11:01:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-12 11:01:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 261. [2022-07-12 11:01:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 176 states have (on average 1.1534090909090908) internal successors, (203), 187 states have internal predecessors, (203), 59 states have call successors, (59), 25 states have call predecessors, (59), 25 states have return successors, (72), 48 states have call predecessors, (72), 56 states have call successors, (72) [2022-07-12 11:01:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 334 transitions. [2022-07-12 11:01:51,728 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 334 transitions. Word has length 86 [2022-07-12 11:01:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:51,729 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 334 transitions. [2022-07-12 11:01:51,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 28 states have internal predecessors, (102), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-12 11:01:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 334 transitions. [2022-07-12 11:01:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-12 11:01:51,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:51,731 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 11:01:51,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:51,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:51,932 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash -98466641, now seen corresponding path program 1 times [2022-07-12 11:01:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:51,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625189773] [2022-07-12 11:01:51,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:01:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:01:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 11:01:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:01:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:01:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:01:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:01:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-12 11:01:52,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:52,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625189773] [2022-07-12 11:01:52,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625189773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:52,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288383357] [2022-07-12 11:01:52,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:52,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:52,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:52,204 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:52,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 11:01:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 2633 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:01:52,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 11:01:52,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:52,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288383357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:52,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:52,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-12 11:01:52,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567140890] [2022-07-12 11:01:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:52,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:01:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:52,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:01:52,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:01:52,664 INFO L87 Difference]: Start difference. First operand 261 states and 334 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 11:01:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:52,769 INFO L93 Difference]: Finished difference Result 404 states and 530 transitions. [2022-07-12 11:01:52,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:01:52,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 85 [2022-07-12 11:01:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:52,771 INFO L225 Difference]: With dead ends: 404 [2022-07-12 11:01:52,772 INFO L226 Difference]: Without dead ends: 256 [2022-07-12 11:01:52,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:01:52,773 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:52,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 774 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-12 11:01:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-07-12 11:01:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 182 states have internal predecessors, (198), 59 states have call successors, (59), 25 states have call predecessors, (59), 24 states have return successors, (69), 48 states have call predecessors, (69), 56 states have call successors, (69) [2022-07-12 11:01:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2022-07-12 11:01:52,815 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 85 [2022-07-12 11:01:52,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:52,815 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2022-07-12 11:01:52,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 11:01:52,815 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2022-07-12 11:01:52,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 11:01:52,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:52,817 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 11:01:52,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:53,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:53,034 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:53,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1314150920, now seen corresponding path program 2 times [2022-07-12 11:01:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:53,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602262055] [2022-07-12 11:01:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:01:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:01:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:01:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:01:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:01:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 11:01:54,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:54,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602262055] [2022-07-12 11:01:54,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602262055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:54,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:54,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-12 11:01:54,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123050602] [2022-07-12 11:01:54,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:54,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 11:01:54,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:54,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 11:01:54,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:01:54,150 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 11:01:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:56,451 INFO L93 Difference]: Finished difference Result 403 states and 538 transitions. [2022-07-12 11:01:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 11:01:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 87 [2022-07-12 11:01:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:56,455 INFO L225 Difference]: With dead ends: 403 [2022-07-12 11:01:56,455 INFO L226 Difference]: Without dead ends: 332 [2022-07-12 11:01:56,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=1137, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 11:01:56,457 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 170 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:56,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 687 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 11:01:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-12 11:01:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 263. [2022-07-12 11:01:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 178 states have (on average 1.151685393258427) internal successors, (205), 189 states have internal predecessors, (205), 59 states have call successors, (59), 25 states have call predecessors, (59), 25 states have return successors, (71), 48 states have call predecessors, (71), 56 states have call successors, (71) [2022-07-12 11:01:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 335 transitions. [2022-07-12 11:01:56,501 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 335 transitions. Word has length 87 [2022-07-12 11:01:56,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:56,502 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 335 transitions. [2022-07-12 11:01:56,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 11:01:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 335 transitions. [2022-07-12 11:01:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 11:01:56,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:56,504 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 11:01:56,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 11:01:56,505 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:56,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1572316358, now seen corresponding path program 1 times [2022-07-12 11:01:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:56,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998844868] [2022-07-12 11:01:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:01:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:01:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:01:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:01:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:01:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 11:01:56,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:56,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998844868] [2022-07-12 11:01:56,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998844868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:56,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206469357] [2022-07-12 11:01:56,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:56,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:56,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:56,964 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:56,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 11:01:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:57,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:01:57,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 11:01:57,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:57,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206469357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:57,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:57,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 20 [2022-07-12 11:01:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867192115] [2022-07-12 11:01:57,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:57,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:01:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:57,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:01:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-07-12 11:01:57,525 INFO L87 Difference]: Start difference. First operand 263 states and 335 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 11:01:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:57,670 INFO L93 Difference]: Finished difference Result 410 states and 544 transitions. [2022-07-12 11:01:57,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:01:57,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2022-07-12 11:01:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:57,673 INFO L225 Difference]: With dead ends: 410 [2022-07-12 11:01:57,673 INFO L226 Difference]: Without dead ends: 256 [2022-07-12 11:01:57,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:01:57,675 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:57,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 247 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-07-12 11:01:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-12 11:01:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-07-12 11:01:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 172 states have (on average 1.1395348837209303) internal successors, (196), 182 states have internal predecessors, (196), 59 states have call successors, (59), 25 states have call predecessors, (59), 24 states have return successors, (66), 48 states have call predecessors, (66), 56 states have call successors, (66) [2022-07-12 11:01:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 321 transitions. [2022-07-12 11:01:57,718 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 321 transitions. Word has length 87 [2022-07-12 11:01:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:57,718 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 321 transitions. [2022-07-12 11:01:57,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 11:01:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 321 transitions. [2022-07-12 11:01:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 11:01:57,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:57,720 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:57,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:57,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 11:01:57,939 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:57,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:57,940 INFO L85 PathProgramCache]: Analyzing trace with hash -375331136, now seen corresponding path program 1 times [2022-07-12 11:01:57,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:57,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215058458] [2022-07-12 11:01:57,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:57,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:01:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:01:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:01:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:01:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:01:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:01:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:01:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 11:01:58,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:58,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215058458] [2022-07-12 11:01:58,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215058458] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:58,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329818034] [2022-07-12 11:01:58,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:58,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:58,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:58,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:58,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 11:01:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:59,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 11:01:59,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:59,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:01:59,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 11:01:59,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 11:01:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 11:01:59,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:59,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329818034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:59,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:59,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 33 [2022-07-12 11:01:59,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853352625] [2022-07-12 11:01:59,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:59,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:01:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:01:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 11:01:59,678 INFO L87 Difference]: Start difference. First operand 256 states and 321 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-12 11:02:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:00,055 INFO L93 Difference]: Finished difference Result 406 states and 511 transitions. [2022-07-12 11:02:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 11:02:00,056 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 88 [2022-07-12 11:02:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:00,058 INFO L225 Difference]: With dead ends: 406 [2022-07-12 11:02:00,058 INFO L226 Difference]: Without dead ends: 311 [2022-07-12 11:02:00,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 11:02:00,060 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 80 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:00,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1037 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 123 Unchecked, 0.2s Time] [2022-07-12 11:02:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-07-12 11:02:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 265. [2022-07-12 11:02:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 180 states have (on average 1.1222222222222222) internal successors, (202), 190 states have internal predecessors, (202), 57 states have call successors, (57), 26 states have call predecessors, (57), 27 states have return successors, (64), 48 states have call predecessors, (64), 54 states have call successors, (64) [2022-07-12 11:02:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2022-07-12 11:02:00,111 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 88 [2022-07-12 11:02:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:00,111 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2022-07-12 11:02:00,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-12 11:02:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2022-07-12 11:02:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:02:00,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:00,113 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-12 11:02:00,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:00,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 11:02:00,327 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash -253022058, now seen corresponding path program 1 times [2022-07-12 11:02:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:00,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235156971] [2022-07-12 11:02:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-12 11:02:00,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:00,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235156971] [2022-07-12 11:02:00,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235156971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:00,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:00,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:02:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113714190] [2022-07-12 11:02:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:00,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:02:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:02:00,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:02:00,504 INFO L87 Difference]: Start difference. First operand 265 states and 323 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-12 11:02:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:00,547 INFO L93 Difference]: Finished difference Result 279 states and 340 transitions. [2022-07-12 11:02:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:02:00,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2022-07-12 11:02:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:00,549 INFO L225 Difference]: With dead ends: 279 [2022-07-12 11:02:00,549 INFO L226 Difference]: Without dead ends: 266 [2022-07-12 11:02:00,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:02:00,551 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:00,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:02:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-12 11:02:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-07-12 11:02:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 181 states have (on average 1.1215469613259668) internal successors, (203), 191 states have internal predecessors, (203), 57 states have call successors, (57), 26 states have call predecessors, (57), 27 states have return successors, (64), 48 states have call predecessors, (64), 54 states have call successors, (64) [2022-07-12 11:02:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2022-07-12 11:02:00,593 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 90 [2022-07-12 11:02:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:00,595 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2022-07-12 11:02:00,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-12 11:02:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2022-07-12 11:02:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:02:00,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:00,597 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-12 11:02:00,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 11:02:00,597 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:00,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash -266130098, now seen corresponding path program 1 times [2022-07-12 11:02:00,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:00,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934800212] [2022-07-12 11:02:00,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-12 11:02:00,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:00,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934800212] [2022-07-12 11:02:00,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934800212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:00,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:00,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:02:00,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738003093] [2022-07-12 11:02:00,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:00,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:02:00,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:00,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:02:00,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:02:00,836 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:02:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:01,126 INFO L93 Difference]: Finished difference Result 305 states and 379 transitions. [2022-07-12 11:02:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:02:01,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2022-07-12 11:02:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:01,128 INFO L225 Difference]: With dead ends: 305 [2022-07-12 11:02:01,128 INFO L226 Difference]: Without dead ends: 303 [2022-07-12 11:02:01,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:02:01,129 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 24 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:01,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 754 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:02:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-12 11:02:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 291. [2022-07-12 11:02:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 194 states have (on average 1.1237113402061856) internal successors, (218), 205 states have internal predecessors, (218), 68 states have call successors, (68), 27 states have call predecessors, (68), 28 states have return successors, (75), 58 states have call predecessors, (75), 65 states have call successors, (75) [2022-07-12 11:02:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 361 transitions. [2022-07-12 11:02:01,180 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 361 transitions. Word has length 90 [2022-07-12 11:02:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:01,181 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 361 transitions. [2022-07-12 11:02:01,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:02:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 361 transitions. [2022-07-12 11:02:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:02:01,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:01,183 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-12 11:02:01,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 11:02:01,183 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash -195763756, now seen corresponding path program 1 times [2022-07-12 11:02:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:01,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278163267] [2022-07-12 11:02:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-12 11:02:01,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:01,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278163267] [2022-07-12 11:02:01,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278163267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:01,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:01,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 11:02:01,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663412100] [2022-07-12 11:02:01,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:01,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:02:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:01,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:02:01,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:02:01,583 INFO L87 Difference]: Start difference. First operand 291 states and 361 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 11:02:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:02,408 INFO L93 Difference]: Finished difference Result 315 states and 392 transitions. [2022-07-12 11:02:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:02:02,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 90 [2022-07-12 11:02:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:02,411 INFO L225 Difference]: With dead ends: 315 [2022-07-12 11:02:02,411 INFO L226 Difference]: Without dead ends: 313 [2022-07-12 11:02:02,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:02:02,412 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 63 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:02,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 951 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:02:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-12 11:02:02,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 300. [2022-07-12 11:02:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 200 states have (on average 1.13) internal successors, (226), 211 states have internal predecessors, (226), 70 states have call successors, (70), 28 states have call predecessors, (70), 29 states have return successors, (77), 60 states have call predecessors, (77), 67 states have call successors, (77) [2022-07-12 11:02:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 373 transitions. [2022-07-12 11:02:02,470 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 373 transitions. Word has length 90 [2022-07-12 11:02:02,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:02,471 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 373 transitions. [2022-07-12 11:02:02,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 11:02:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 373 transitions. [2022-07-12 11:02:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:02:02,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:02,473 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-12 11:02:02,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 11:02:02,473 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:02,474 INFO L85 PathProgramCache]: Analyzing trace with hash -747210356, now seen corresponding path program 1 times [2022-07-12 11:02:02,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:02,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142896181] [2022-07-12 11:02:02,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:02,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-12 11:02:03,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:03,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142896181] [2022-07-12 11:02:03,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142896181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:03,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:03,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:02:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041062989] [2022-07-12 11:02:03,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:03,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:02:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:03,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:02:03,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:02:03,030 INFO L87 Difference]: Start difference. First operand 300 states and 373 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:02:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:03,644 INFO L93 Difference]: Finished difference Result 366 states and 470 transitions. [2022-07-12 11:02:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:02:03,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2022-07-12 11:02:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:03,646 INFO L225 Difference]: With dead ends: 366 [2022-07-12 11:02:03,646 INFO L226 Difference]: Without dead ends: 344 [2022-07-12 11:02:03,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:02:03,648 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 23 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:03,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 523 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:02:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-12 11:02:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 327. [2022-07-12 11:02:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 213 states have (on average 1.1267605633802817) internal successors, (240), 223 states have internal predecessors, (240), 84 states have call successors, (84), 28 states have call predecessors, (84), 29 states have return successors, (95), 75 states have call predecessors, (95), 81 states have call successors, (95) [2022-07-12 11:02:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 419 transitions. [2022-07-12 11:02:03,729 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 419 transitions. Word has length 90 [2022-07-12 11:02:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:03,729 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 419 transitions. [2022-07-12 11:02:03,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:02:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 419 transitions. [2022-07-12 11:02:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:02:03,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:03,731 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-12 11:02:03,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 11:02:03,732 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:03,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash -676844014, now seen corresponding path program 1 times [2022-07-12 11:02:03,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:03,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944583562] [2022-07-12 11:02:03,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:03,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-12 11:02:04,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:04,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944583562] [2022-07-12 11:02:04,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944583562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:04,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:04,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 11:02:04,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918846132] [2022-07-12 11:02:04,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:04,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:02:04,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:04,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:02:04,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:02:04,370 INFO L87 Difference]: Start difference. First operand 327 states and 419 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 11:02:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:05,204 INFO L93 Difference]: Finished difference Result 350 states and 448 transitions. [2022-07-12 11:02:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:02:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 90 [2022-07-12 11:02:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:05,207 INFO L225 Difference]: With dead ends: 350 [2022-07-12 11:02:05,207 INFO L226 Difference]: Without dead ends: 348 [2022-07-12 11:02:05,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:02:05,208 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 32 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:05,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 924 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:02:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-12 11:02:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 331. [2022-07-12 11:02:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 216 states have (on average 1.1296296296296295) internal successors, (244), 225 states have internal predecessors, (244), 85 states have call successors, (85), 28 states have call predecessors, (85), 29 states have return successors, (96), 77 states have call predecessors, (96), 82 states have call successors, (96) [2022-07-12 11:02:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 425 transitions. [2022-07-12 11:02:05,278 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 425 transitions. Word has length 90 [2022-07-12 11:02:05,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:05,278 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 425 transitions. [2022-07-12 11:02:05,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 11:02:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 425 transitions. [2022-07-12 11:02:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:02:05,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:05,280 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-12 11:02:05,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 11:02:05,281 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:05,281 INFO L85 PathProgramCache]: Analyzing trace with hash -689952054, now seen corresponding path program 1 times [2022-07-12 11:02:05,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:05,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782875530] [2022-07-12 11:02:05,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:05,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 11:02:05,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:05,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782875530] [2022-07-12 11:02:05,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782875530] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:05,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141254224] [2022-07-12 11:02:05,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:05,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:05,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:05,748 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:05,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 11:02:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 2634 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 11:02:06,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:06,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2022-07-12 11:02:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 11:02:06,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:06,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-07-12 11:02:06,964 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:02:06,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:02:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 11:02:06,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141254224] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:02:06,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:02:06,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 22 [2022-07-12 11:02:06,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84606367] [2022-07-12 11:02:06,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:06,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 11:02:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:06,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 11:02:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:02:06,976 INFO L87 Difference]: Start difference. First operand 331 states and 425 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 10 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-12 11:02:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:08,728 INFO L93 Difference]: Finished difference Result 529 states and 728 transitions. [2022-07-12 11:02:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 11:02:08,728 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 10 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) Word has length 90 [2022-07-12 11:02:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:08,731 INFO L225 Difference]: With dead ends: 529 [2022-07-12 11:02:08,732 INFO L226 Difference]: Without dead ends: 514 [2022-07-12 11:02:08,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 186 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=328, Invalid=2024, Unknown=0, NotChecked=0, Total=2352 [2022-07-12 11:02:08,734 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 265 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:08,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1406 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 1109 Invalid, 0 Unknown, 219 Unchecked, 1.0s Time] [2022-07-12 11:02:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-07-12 11:02:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 347. [2022-07-12 11:02:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 224 states have (on average 1.125) internal successors, (252), 232 states have internal predecessors, (252), 93 states have call successors, (93), 28 states have call predecessors, (93), 29 states have return successors, (108), 86 states have call predecessors, (108), 90 states have call successors, (108) [2022-07-12 11:02:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 453 transitions. [2022-07-12 11:02:08,821 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 453 transitions. Word has length 90 [2022-07-12 11:02:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:08,822 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 453 transitions. [2022-07-12 11:02:08,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 10 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-12 11:02:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 453 transitions. [2022-07-12 11:02:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 11:02:08,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:08,825 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:08,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:09,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:09,045 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:09,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:09,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1680266801, now seen corresponding path program 1 times [2022-07-12 11:02:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:09,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199497335] [2022-07-12 11:02:09,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:02:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:02:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:02:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:02:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 11:02:09,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:09,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199497335] [2022-07-12 11:02:09,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199497335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:09,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:09,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:02:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346771844] [2022-07-12 11:02:09,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:09,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:02:09,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:09,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:02:09,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:02:09,362 INFO L87 Difference]: Start difference. First operand 347 states and 453 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 11:02:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:09,974 INFO L93 Difference]: Finished difference Result 353 states and 458 transitions. [2022-07-12 11:02:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 11:02:09,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2022-07-12 11:02:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:09,976 INFO L225 Difference]: With dead ends: 353 [2022-07-12 11:02:09,977 INFO L226 Difference]: Without dead ends: 351 [2022-07-12 11:02:09,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-12 11:02:09,978 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 58 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:09,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 678 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:02:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-12 11:02:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2022-07-12 11:02:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 227 states have (on average 1.1233480176211454) internal successors, (255), 235 states have internal predecessors, (255), 93 states have call successors, (93), 29 states have call predecessors, (93), 30 states have return successors, (108), 86 states have call predecessors, (108), 90 states have call successors, (108) [2022-07-12 11:02:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 456 transitions. [2022-07-12 11:02:10,066 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 456 transitions. Word has length 89 [2022-07-12 11:02:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:10,067 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 456 transitions. [2022-07-12 11:02:10,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 11:02:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 456 transitions. [2022-07-12 11:02:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:02:10,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:10,069 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-12 11:02:10,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 11:02:10,070 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1792661847, now seen corresponding path program 1 times [2022-07-12 11:02:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:10,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698247745] [2022-07-12 11:02:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:02:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-12 11:02:10,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:10,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698247745] [2022-07-12 11:02:10,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698247745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:10,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:10,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:02:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463377248] [2022-07-12 11:02:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:10,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:02:10,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:10,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:02:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:02:10,547 INFO L87 Difference]: Start difference. First operand 351 states and 456 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 11:02:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:11,210 INFO L93 Difference]: Finished difference Result 389 states and 507 transitions. [2022-07-12 11:02:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:02:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 96 [2022-07-12 11:02:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:11,212 INFO L225 Difference]: With dead ends: 389 [2022-07-12 11:02:11,213 INFO L226 Difference]: Without dead ends: 371 [2022-07-12 11:02:11,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:11,214 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 14 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:11,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 670 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:02:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-07-12 11:02:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 362. [2022-07-12 11:02:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 232 states have (on average 1.125) internal successors, (261), 240 states have internal predecessors, (261), 99 states have call successors, (99), 29 states have call predecessors, (99), 30 states have return successors, (114), 92 states have call predecessors, (114), 96 states have call successors, (114) [2022-07-12 11:02:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 474 transitions. [2022-07-12 11:02:11,303 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 474 transitions. Word has length 96 [2022-07-12 11:02:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:11,303 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 474 transitions. [2022-07-12 11:02:11,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 11:02:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 474 transitions. [2022-07-12 11:02:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:02:11,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:11,306 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-12 11:02:11,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 11:02:11,306 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1410948513, now seen corresponding path program 1 times [2022-07-12 11:02:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:11,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436949046] [2022-07-12 11:02:11,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:11,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:02:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-12 11:02:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:11,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436949046] [2022-07-12 11:02:11,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436949046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:11,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:11,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:02:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007998611] [2022-07-12 11:02:11,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:11,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:02:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:11,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:02:11,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:02:11,537 INFO L87 Difference]: Start difference. First operand 362 states and 474 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 11:02:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:11,850 INFO L93 Difference]: Finished difference Result 381 states and 497 transitions. [2022-07-12 11:02:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:02:11,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 96 [2022-07-12 11:02:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:11,852 INFO L225 Difference]: With dead ends: 381 [2022-07-12 11:02:11,853 INFO L226 Difference]: Without dead ends: 379 [2022-07-12 11:02:11,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:02:11,854 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 23 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:11,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 705 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:02:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-07-12 11:02:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 368. [2022-07-12 11:02:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 236 states have (on average 1.1228813559322033) internal successors, (265), 244 states have internal predecessors, (265), 100 states have call successors, (100), 30 states have call predecessors, (100), 31 states have return successors, (115), 93 states have call predecessors, (115), 97 states have call successors, (115) [2022-07-12 11:02:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 480 transitions. [2022-07-12 11:02:11,944 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 480 transitions. Word has length 96 [2022-07-12 11:02:11,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:11,944 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 480 transitions. [2022-07-12 11:02:11,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 11:02:11,944 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 480 transitions. [2022-07-12 11:02:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:02:11,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:11,946 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-12 11:02:11,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 11:02:11,947 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:11,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:11,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1751987097, now seen corresponding path program 1 times [2022-07-12 11:02:11,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:11,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93548517] [2022-07-12 11:02:11,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:02:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-12 11:02:12,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:12,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93548517] [2022-07-12 11:02:12,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93548517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:12,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:12,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:02:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518163631] [2022-07-12 11:02:12,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:12,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:02:12,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:12,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:02:12,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:12,516 INFO L87 Difference]: Start difference. First operand 368 states and 480 transitions. Second operand has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-12 11:02:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:13,132 INFO L93 Difference]: Finished difference Result 388 states and 504 transitions. [2022-07-12 11:02:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 11:02:13,133 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 96 [2022-07-12 11:02:13,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:13,135 INFO L225 Difference]: With dead ends: 388 [2022-07-12 11:02:13,135 INFO L226 Difference]: Without dead ends: 386 [2022-07-12 11:02:13,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-07-12 11:02:13,136 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:13,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1027 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:02:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-07-12 11:02:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 375. [2022-07-12 11:02:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 240 states have (on average 1.1208333333333333) internal successors, (269), 249 states have internal predecessors, (269), 102 states have call successors, (102), 31 states have call predecessors, (102), 32 states have return successors, (117), 94 states have call predecessors, (117), 99 states have call successors, (117) [2022-07-12 11:02:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 488 transitions. [2022-07-12 11:02:13,269 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 488 transitions. Word has length 96 [2022-07-12 11:02:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:13,270 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 488 transitions. [2022-07-12 11:02:13,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-12 11:02:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 488 transitions. [2022-07-12 11:02:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:02:13,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:13,272 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-12 11:02:13,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 11:02:13,273 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:13,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:13,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1241388199, now seen corresponding path program 1 times [2022-07-12 11:02:13,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:13,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111536701] [2022-07-12 11:02:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:02:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 11:02:13,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:13,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111536701] [2022-07-12 11:02:13,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111536701] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:13,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122760135] [2022-07-12 11:02:13,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:13,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:13,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:13,635 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:13,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 11:02:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 11:02:14,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:14,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2022-07-12 11:02:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 11:02:14,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:14,659 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:02:14,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2022-07-12 11:02:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 11:02:14,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122760135] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:02:14,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:02:14,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 21 [2022-07-12 11:02:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877735740] [2022-07-12 11:02:14,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:14,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 11:02:14,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 11:02:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:02:14,669 INFO L87 Difference]: Start difference. First operand 375 states and 488 transitions. Second operand has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 10 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2022-07-12 11:02:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:16,526 INFO L93 Difference]: Finished difference Result 609 states and 793 transitions. [2022-07-12 11:02:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-12 11:02:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 10 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) Word has length 96 [2022-07-12 11:02:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:16,530 INFO L225 Difference]: With dead ends: 609 [2022-07-12 11:02:16,530 INFO L226 Difference]: Without dead ends: 499 [2022-07-12 11:02:16,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 204 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=2099, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 11:02:16,532 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 142 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:16,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1056 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1441 Invalid, 0 Unknown, 181 Unchecked, 1.1s Time] [2022-07-12 11:02:16,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-07-12 11:02:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 378. [2022-07-12 11:02:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 241 states have (on average 1.099585062240664) internal successors, (265), 248 states have internal predecessors, (265), 104 states have call successors, (104), 31 states have call predecessors, (104), 32 states have return successors, (119), 98 states have call predecessors, (119), 101 states have call successors, (119) [2022-07-12 11:02:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 488 transitions. [2022-07-12 11:02:16,627 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 488 transitions. Word has length 96 [2022-07-12 11:02:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:16,628 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 488 transitions. [2022-07-12 11:02:16,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 10 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2022-07-12 11:02:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 488 transitions. [2022-07-12 11:02:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 11:02:16,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:16,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:16,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:16,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:16,830 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:16,831 INFO L85 PathProgramCache]: Analyzing trace with hash 263298865, now seen corresponding path program 1 times [2022-07-12 11:02:16,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:16,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045592592] [2022-07-12 11:02:16,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:02:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:02:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:02:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:02:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:02:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:02:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:02:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 11:02:17,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:17,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045592592] [2022-07-12 11:02:17,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045592592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:17,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436746841] [2022-07-12 11:02:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:17,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:17,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:17,480 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:17,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 11:02:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 2683 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-12 11:02:17,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:18,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:02:22,265 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:02:22,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-12 11:02:22,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 11:02:22,316 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:02:22,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 27 [2022-07-12 11:02:22,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:02:22,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:22,687 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 11:02:22,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-07-12 11:02:22,707 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-12 11:02:22,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-07-12 11:02:22,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 11:02:22,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2022-07-12 11:02:22,739 INFO L356 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2022-07-12 11:02:22,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-12 11:02:22,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 11:02:22,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-07-12 11:02:22,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2022-07-12 11:02:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 41 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 11:02:23,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:24,381 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:02:24,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-12 11:02:24,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:02:24,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 11:02:24,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| Int) (v_ArrVal_2183 Int) (v_arrayElimArr_10 (Array Int Int)) (aux_div_v_ArrVal_2182_40 Int) (v_ArrVal_2176 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) 8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset| 8))) 0 v_ArrVal_2183)) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_ArrVal_2176) |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) 8) 0)) (< (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|) 18446744073709551616) (mod (select v_arrayElimArr_10 0) 18446744073709551616)) (= (mod (select (select (store (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_arrayElimArr_11) |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) 0) 18446744073709551616) 0) (not (= (select v_arrayElimArr_11 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|) (* 18446744073709551616 aux_div_v_ArrVal_2182_40))))) is different from false [2022-07-12 11:02:24,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436746841] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:24,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:24,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26] total 41 [2022-07-12 11:02:24,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548755364] [2022-07-12 11:02:24,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:24,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 11:02:24,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:24,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 11:02:24,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2626, Unknown=27, NotChecked=104, Total=2970 [2022-07-12 11:02:24,703 INFO L87 Difference]: Start difference. First operand 378 states and 488 transitions. Second operand has 41 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 16 states have call successors, (23), 5 states have call predecessors, (23), 8 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-12 11:02:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:30,541 INFO L93 Difference]: Finished difference Result 529 states and 686 transitions. [2022-07-12 11:02:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-12 11:02:30,542 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 16 states have call successors, (23), 5 states have call predecessors, (23), 8 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) Word has length 95 [2022-07-12 11:02:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:30,544 INFO L225 Difference]: With dead ends: 529 [2022-07-12 11:02:30,545 INFO L226 Difference]: Without dead ends: 471 [2022-07-12 11:02:30,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 112 SyntacticMatches, 9 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=730, Invalid=8176, Unknown=28, NotChecked=186, Total=9120 [2022-07-12 11:02:30,548 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 169 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 3776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 600 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:30,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1092 Invalid, 3776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2890 Invalid, 0 Unknown, 600 Unchecked, 2.0s Time] [2022-07-12 11:02:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-07-12 11:02:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 382. [2022-07-12 11:02:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 245 states have (on average 1.0979591836734695) internal successors, (269), 252 states have internal predecessors, (269), 102 states have call successors, (102), 33 states have call predecessors, (102), 34 states have return successors, (113), 96 states have call predecessors, (113), 99 states have call successors, (113) [2022-07-12 11:02:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 484 transitions. [2022-07-12 11:02:30,638 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 484 transitions. Word has length 95 [2022-07-12 11:02:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:30,638 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 484 transitions. [2022-07-12 11:02:30,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 16 states have call successors, (23), 5 states have call predecessors, (23), 8 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-12 11:02:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 484 transitions. [2022-07-12 11:02:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 11:02:30,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:30,640 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:30,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-12 11:02:30,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-12 11:02:30,864 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1566240838, now seen corresponding path program 1 times [2022-07-12 11:02:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:30,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008370259] [2022-07-12 11:02:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:02:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:02:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:02:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:02:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:02:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:02:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:02:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:02:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:02:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-12 11:02:31,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:31,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008370259] [2022-07-12 11:02:31,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008370259] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:31,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207639799] [2022-07-12 11:02:31,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:31,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:31,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:31,530 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:31,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 11:02:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:31,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 2668 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-12 11:02:31,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:32,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:02:32,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:02:32,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-12 11:02:33,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2022-07-12 11:02:33,097 INFO L356 Elim1Store]: treesize reduction 65, result has 39.3 percent of original size [2022-07-12 11:02:33,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 64 [2022-07-12 11:02:33,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 11:02:33,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:02:33,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-12 11:02:33,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-12 11:02:33,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 11:02:34,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:02:34,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2022-07-12 11:02:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 55 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 11:02:34,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:34,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:02:34,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-12 11:02:34,620 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:02:34,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 11:02:34,637 WARN L833 $PredicateComparison]: unable to prove that (and (not (< 9223372036854775807 (mod |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2#1| 18446744073709551616))) (forall ((|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| Int) (v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_arrayElimArr_14 (Array Int Int)) (aux_div_v_ArrVal_2301_40 Int)) (or (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|) |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1|)) (not (< 9223372036854775807 (mod (select (select (store (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_13) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset|) 18446744073709551616))) (not (= (* 18446744073709551616 aux_div_v_ArrVal_2301_40) (select v_arrayElimArr_14 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|)))))) is different from false [2022-07-12 11:02:34,660 WARN L833 $PredicateComparison]: unable to prove that (or (and (not (< 9223372036854775807 (mod |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2#1| 18446744073709551616))) (forall ((|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| Int) (v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_arrayElimArr_14 (Array Int Int)) (aux_div_v_ArrVal_2301_40 Int)) (or (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|) |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1|)) (not (< 9223372036854775807 (mod (select (select (store (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_13) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset|) 18446744073709551616))) (not (= (* 18446744073709551616 aux_div_v_ArrVal_2301_40) (select v_arrayElimArr_14 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|)))))) |c_ULTIMATE.start_aws_byte_cursor_advance_#t~short1082#1|) is different from false [2022-07-12 11:02:34,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207639799] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:34,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:34,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 38 [2022-07-12 11:02:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457664025] [2022-07-12 11:02:34,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:34,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 11:02:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:34,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 11:02:34,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1579, Unknown=2, NotChecked=162, Total=1892 [2022-07-12 11:02:34,798 INFO L87 Difference]: Start difference. First operand 382 states and 484 transitions. Second operand has 38 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 13 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-12 11:02:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:40,093 INFO L93 Difference]: Finished difference Result 514 states and 623 transitions. [2022-07-12 11:02:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-12 11:02:40,093 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 13 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) Word has length 101 [2022-07-12 11:02:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:40,095 INFO L225 Difference]: With dead ends: 514 [2022-07-12 11:02:40,095 INFO L226 Difference]: Without dead ends: 493 [2022-07-12 11:02:40,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 148 SyntacticMatches, 18 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2276 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=588, Invalid=6727, Unknown=3, NotChecked=338, Total=7656 [2022-07-12 11:02:40,097 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 289 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 3606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 981 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:40,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 628 Invalid, 3606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2354 Invalid, 0 Unknown, 981 Unchecked, 1.5s Time] [2022-07-12 11:02:40,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-07-12 11:02:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 467. [2022-07-12 11:02:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 308 states have (on average 1.0844155844155845) internal successors, (334), 316 states have internal predecessors, (334), 112 states have call successors, (112), 45 states have call predecessors, (112), 46 states have return successors, (120), 105 states have call predecessors, (120), 106 states have call successors, (120) [2022-07-12 11:02:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 566 transitions. [2022-07-12 11:02:40,214 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 566 transitions. Word has length 101 [2022-07-12 11:02:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:40,214 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 566 transitions. [2022-07-12 11:02:40,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 13 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-12 11:02:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 566 transitions. [2022-07-12 11:02:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 11:02:40,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:40,216 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:40,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:40,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:40,431 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:40,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:40,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1636607180, now seen corresponding path program 1 times [2022-07-12 11:02:40,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:40,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444014815] [2022-07-12 11:02:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:02:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:02:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:02:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:02:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:02:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:02:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:02:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:02:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:02:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 11:02:41,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:41,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444014815] [2022-07-12 11:02:41,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444014815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:41,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:41,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-12 11:02:41,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008499232] [2022-07-12 11:02:41,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:41,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 11:02:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:41,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 11:02:41,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:02:41,188 INFO L87 Difference]: Start difference. First operand 467 states and 566 transitions. Second operand has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-12 11:02:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:42,298 INFO L93 Difference]: Finished difference Result 484 states and 585 transitions. [2022-07-12 11:02:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 11:02:42,299 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 101 [2022-07-12 11:02:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:42,301 INFO L225 Difference]: With dead ends: 484 [2022-07-12 11:02:42,301 INFO L226 Difference]: Without dead ends: 482 [2022-07-12 11:02:42,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-07-12 11:02:42,302 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 63 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:42,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 367 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:02:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-12 11:02:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 475. [2022-07-12 11:02:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 314 states have (on average 1.0828025477707006) internal successors, (340), 322 states have internal predecessors, (340), 113 states have call successors, (113), 46 states have call predecessors, (113), 47 states have return successors, (121), 106 states have call predecessors, (121), 107 states have call successors, (121) [2022-07-12 11:02:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 574 transitions. [2022-07-12 11:02:42,396 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 574 transitions. Word has length 101 [2022-07-12 11:02:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:42,396 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 574 transitions. [2022-07-12 11:02:42,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-12 11:02:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 574 transitions. [2022-07-12 11:02:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 11:02:42,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:42,398 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 11:02:42,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-12 11:02:42,399 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash -326672390, now seen corresponding path program 1 times [2022-07-12 11:02:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:42,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192505] [2022-07-12 11:02:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:02:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:02:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 11:02:44,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:44,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192505] [2022-07-12 11:02:44,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:44,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462469543] [2022-07-12 11:02:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:44,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:44,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:44,538 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:44,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 11:02:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:44,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 2666 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-12 11:02:45,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:45,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:02:45,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:02:45,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:02:45,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-07-12 11:02:45,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:02:45,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:45,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:02:45,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:45,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:45,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:02:45,925 INFO L356 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2022-07-12 11:02:45,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 41 [2022-07-12 11:02:45,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:02:45,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:45,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:45,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:45,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:02:45,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:02:45,959 INFO L356 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2022-07-12 11:02:45,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 37 [2022-07-12 11:02:46,912 INFO L356 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2022-07-12 11:02:46,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 16 [2022-07-12 11:02:46,920 INFO L356 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2022-07-12 11:02:46,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2022-07-12 11:02:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 19 proven. 52 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:02:47,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:48,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462469543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:48,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:48,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 49 [2022-07-12 11:02:48,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578004184] [2022-07-12 11:02:48,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:48,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 11:02:48,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:48,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 11:02:48,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3003, Unknown=0, NotChecked=0, Total=3192 [2022-07-12 11:02:48,322 INFO L87 Difference]: Start difference. First operand 475 states and 574 transitions. Second operand has 49 states, 42 states have (on average 2.0) internal successors, (84), 46 states have internal predecessors, (84), 20 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) [2022-07-12 11:02:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:52,475 INFO L93 Difference]: Finished difference Result 540 states and 664 transitions. [2022-07-12 11:02:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-12 11:02:52,476 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 42 states have (on average 2.0) internal successors, (84), 46 states have internal predecessors, (84), 20 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) Word has length 102 [2022-07-12 11:02:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:52,478 INFO L225 Difference]: With dead ends: 540 [2022-07-12 11:02:52,478 INFO L226 Difference]: Without dead ends: 538 [2022-07-12 11:02:52,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 105 SyntacticMatches, 16 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=494, Invalid=6988, Unknown=0, NotChecked=0, Total=7482 [2022-07-12 11:02:52,479 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 135 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 729 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:52,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1519 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2308 Invalid, 0 Unknown, 729 Unchecked, 2.0s Time] [2022-07-12 11:02:52,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-07-12 11:02:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2022-07-12 11:02:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 329 states have (on average 1.0790273556231003) internal successors, (355), 337 states have internal predecessors, (355), 121 states have call successors, (121), 48 states have call predecessors, (121), 49 states have return successors, (129), 114 states have call predecessors, (129), 115 states have call successors, (129) [2022-07-12 11:02:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 605 transitions. [2022-07-12 11:02:52,582 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 605 transitions. Word has length 102 [2022-07-12 11:02:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:52,582 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 605 transitions. [2022-07-12 11:02:52,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 42 states have (on average 2.0) internal successors, (84), 46 states have internal predecessors, (84), 20 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) [2022-07-12 11:02:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 605 transitions. [2022-07-12 11:02:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 11:02:52,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:52,583 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-12 11:02:52,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:52,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-12 11:02:52,798 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1201612672, now seen corresponding path program 2 times [2022-07-12 11:02:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:52,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468548005] [2022-07-12 11:02:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:02:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:02:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:02:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:02:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:02:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:02:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 11:02:53,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:53,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468548005] [2022-07-12 11:02:53,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468548005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:53,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:53,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-12 11:02:53,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2511350] [2022-07-12 11:02:53,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:53,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 11:02:53,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:53,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 11:02:53,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-07-12 11:02:53,503 INFO L87 Difference]: Start difference. First operand 500 states and 605 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-12 11:02:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:55,325 INFO L93 Difference]: Finished difference Result 588 states and 717 transitions. [2022-07-12 11:02:55,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 11:02:55,325 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 101 [2022-07-12 11:02:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:55,327 INFO L225 Difference]: With dead ends: 588 [2022-07-12 11:02:55,327 INFO L226 Difference]: Without dead ends: 521 [2022-07-12 11:02:55,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 11:02:55,328 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 99 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:55,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 673 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 11:02:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-07-12 11:02:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 500. [2022-07-12 11:02:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 329 states have (on average 1.0790273556231003) internal successors, (355), 337 states have internal predecessors, (355), 121 states have call successors, (121), 48 states have call predecessors, (121), 49 states have return successors, (127), 114 states have call predecessors, (127), 115 states have call successors, (127) [2022-07-12 11:02:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 603 transitions. [2022-07-12 11:02:55,436 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 603 transitions. Word has length 101 [2022-07-12 11:02:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:55,437 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 603 transitions. [2022-07-12 11:02:55,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-12 11:02:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 603 transitions. [2022-07-12 11:02:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 11:02:55,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:55,439 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 11:02:55,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-12 11:02:55,439 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:55,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:55,440 INFO L85 PathProgramCache]: Analyzing trace with hash -808905162, now seen corresponding path program 1 times [2022-07-12 11:02:55,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:55,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556482764] [2022-07-12 11:02:55,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:55,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:02:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:02:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:02:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:02:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:02:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:02:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-12 11:02:55,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:55,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556482764] [2022-07-12 11:02:55,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556482764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:55,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:55,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:02:55,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992971043] [2022-07-12 11:02:55,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:55,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:02:55,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:55,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:02:55,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:02:55,810 INFO L87 Difference]: Start difference. First operand 500 states and 603 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 11:02:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:56,352 INFO L93 Difference]: Finished difference Result 506 states and 608 transitions. [2022-07-12 11:02:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:02:56,352 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 106 [2022-07-12 11:02:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:56,354 INFO L225 Difference]: With dead ends: 506 [2022-07-12 11:02:56,354 INFO L226 Difference]: Without dead ends: 459 [2022-07-12 11:02:56,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:02:56,355 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:56,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 760 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:02:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-07-12 11:02:56,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2022-07-12 11:02:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 306 states have (on average 1.0718954248366013) internal successors, (328), 313 states have internal predecessors, (328), 105 states have call successors, (105), 45 states have call predecessors, (105), 47 states have return successors, (113), 100 states have call predecessors, (113), 101 states have call successors, (113) [2022-07-12 11:02:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 546 transitions. [2022-07-12 11:02:56,441 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 546 transitions. Word has length 106 [2022-07-12 11:02:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:56,441 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 546 transitions. [2022-07-12 11:02:56,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 11:02:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 546 transitions. [2022-07-12 11:02:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 11:02:56,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:56,443 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 11:02:56,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-12 11:02:56,444 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1821091513, now seen corresponding path program 1 times [2022-07-12 11:02:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:56,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672904293] [2022-07-12 11:02:56,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:56,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:02:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:02:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:02:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:02:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:02:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:02:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:02:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:02:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 11:02:56,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:56,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672904293] [2022-07-12 11:02:56,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672904293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:56,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:56,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:02:56,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135847942] [2022-07-12 11:02:56,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:56,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:02:56,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:56,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:02:56,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:02:56,695 INFO L87 Difference]: Start difference. First operand 459 states and 546 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-12 11:02:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:57,268 INFO L93 Difference]: Finished difference Result 465 states and 551 transitions. [2022-07-12 11:02:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 11:02:57,269 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2022-07-12 11:02:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:57,270 INFO L225 Difference]: With dead ends: 465 [2022-07-12 11:02:57,270 INFO L226 Difference]: Without dead ends: 463 [2022-07-12 11:02:57,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-12 11:02:57,271 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 63 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:57,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 638 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:02:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-07-12 11:02:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2022-07-12 11:02:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 309 states have (on average 1.0711974110032363) internal successors, (331), 316 states have internal predecessors, (331), 105 states have call successors, (105), 46 states have call predecessors, (105), 48 states have return successors, (113), 100 states have call predecessors, (113), 101 states have call successors, (113) [2022-07-12 11:02:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 549 transitions. [2022-07-12 11:02:57,349 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 549 transitions. Word has length 103 [2022-07-12 11:02:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:57,350 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 549 transitions. [2022-07-12 11:02:57,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-12 11:02:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 549 transitions. [2022-07-12 11:02:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 11:02:57,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:57,351 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:57,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-12 11:02:57,352 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1257386079, now seen corresponding path program 1 times [2022-07-12 11:02:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:57,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098816950] [2022-07-12 11:02:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:02:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:02:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:02:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:02:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:02:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:02:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:02:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:02:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:02:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:02:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-12 11:02:57,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:57,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098816950] [2022-07-12 11:02:57,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098816950] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:57,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932397262] [2022-07-12 11:02:57,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:57,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:57,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:57,964 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:57,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 11:02:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:58,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 2686 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-12 11:02:58,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:58,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:02:58,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-12 11:02:59,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:02:59,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-07-12 11:02:59,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-12 11:02:59,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 11:02:59,356 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:02:59,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 11:02:59,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:03:00,483 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 11:03:00,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 18 [2022-07-12 11:03:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 11:03:00,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:00,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932397262] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:00,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:03:00,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31] total 45 [2022-07-12 11:03:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480681003] [2022-07-12 11:03:00,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:00,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-12 11:03:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:00,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-12 11:03:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2285, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 11:03:00,947 INFO L87 Difference]: Start difference. First operand 463 states and 549 transitions. Second operand has 45 states, 40 states have (on average 2.425) internal successors, (97), 39 states have internal predecessors, (97), 16 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 11:03:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:06,074 INFO L93 Difference]: Finished difference Result 627 states and 756 transitions. [2022-07-12 11:03:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-07-12 11:03:06,074 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.425) internal successors, (97), 39 states have internal predecessors, (97), 16 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) Word has length 107 [2022-07-12 11:03:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:06,076 INFO L225 Difference]: With dead ends: 627 [2022-07-12 11:03:06,076 INFO L226 Difference]: Without dead ends: 623 [2022-07-12 11:03:06,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 126 SyntacticMatches, 20 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5450 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1051, Invalid=13955, Unknown=0, NotChecked=0, Total=15006 [2022-07-12 11:03:06,078 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 393 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3733 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 5908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 3733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1834 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:06,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 974 Invalid, 5908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 3733 Invalid, 0 Unknown, 1834 Unchecked, 2.6s Time] [2022-07-12 11:03:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-07-12 11:03:06,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 507. [2022-07-12 11:03:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 343 states have (on average 1.064139941690962) internal successors, (365), 349 states have internal predecessors, (365), 108 states have call successors, (108), 54 states have call predecessors, (108), 55 states have return successors, (115), 103 states have call predecessors, (115), 103 states have call successors, (115) [2022-07-12 11:03:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 588 transitions. [2022-07-12 11:03:06,173 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 588 transitions. Word has length 107 [2022-07-12 11:03:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:06,174 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 588 transitions. [2022-07-12 11:03:06,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.425) internal successors, (97), 39 states have internal predecessors, (97), 16 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 11:03:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 588 transitions. [2022-07-12 11:03:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 11:03:06,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:06,175 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 11:03:06,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:06,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:06,388 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:06,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1379697227, now seen corresponding path program 1 times [2022-07-12 11:03:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:06,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85578205] [2022-07-12 11:03:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:03:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:03:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:03:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:03:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:03:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:03:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:03:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:03:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:03:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:03:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:03:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:03:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:03:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-12 11:03:06,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:06,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85578205] [2022-07-12 11:03:06,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85578205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:06,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:06,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 11:03:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418378809] [2022-07-12 11:03:06,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:06,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:03:06,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:06,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:03:06,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:03:06,949 INFO L87 Difference]: Start difference. First operand 507 states and 588 transitions. Second operand has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-12 11:03:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:07,489 INFO L93 Difference]: Finished difference Result 513 states and 593 transitions. [2022-07-12 11:03:07,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:03:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 108 [2022-07-12 11:03:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:07,492 INFO L225 Difference]: With dead ends: 513 [2022-07-12 11:03:07,492 INFO L226 Difference]: Without dead ends: 409 [2022-07-12 11:03:07,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:03:07,493 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 27 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:07,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 665 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:03:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-12 11:03:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2022-07-12 11:03:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 273 states have (on average 1.0732600732600732) internal successors, (293), 278 states have internal predecessors, (293), 94 states have call successors, (94), 41 states have call predecessors, (94), 41 states have return successors, (101), 89 states have call predecessors, (101), 90 states have call successors, (101) [2022-07-12 11:03:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 488 transitions. [2022-07-12 11:03:07,576 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 488 transitions. Word has length 108 [2022-07-12 11:03:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:07,576 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 488 transitions. [2022-07-12 11:03:07,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-12 11:03:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 488 transitions. [2022-07-12 11:03:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 11:03:07,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:07,578 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2022-07-12 11:03:07,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-12 11:03:07,578 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:07,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1880590197, now seen corresponding path program 1 times [2022-07-12 11:03:07,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:07,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231432599] [2022-07-12 11:03:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:03:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:03:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 11:03:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:03:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:03:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:03:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:03:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:03:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:03:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:03:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:03:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:03:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 11:03:08,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:08,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231432599] [2022-07-12 11:03:08,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231432599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:08,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354034808] [2022-07-12 11:03:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:08,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:08,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:08,176 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:08,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 11:03:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 2688 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 11:03:08,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:08,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:08,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-12 11:03:08,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:08,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354034808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:08,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:08,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-07-12 11:03:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813865706] [2022-07-12 11:03:08,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:08,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:03:08,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:08,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:03:08,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:03:08,956 INFO L87 Difference]: Start difference. First operand 409 states and 488 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 11:03:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:09,067 INFO L93 Difference]: Finished difference Result 421 states and 498 transitions. [2022-07-12 11:03:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:03:09,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2022-07-12 11:03:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:09,069 INFO L225 Difference]: With dead ends: 421 [2022-07-12 11:03:09,069 INFO L226 Difference]: Without dead ends: 323 [2022-07-12 11:03:09,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-07-12 11:03:09,069 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 38 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:09,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 258 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2022-07-12 11:03:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-12 11:03:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-07-12 11:03:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 210 states have (on average 1.0857142857142856) internal successors, (228), 215 states have internal predecessors, (228), 81 states have call successors, (81), 30 states have call predecessors, (81), 31 states have return successors, (89), 77 states have call predecessors, (89), 78 states have call successors, (89) [2022-07-12 11:03:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 398 transitions. [2022-07-12 11:03:09,151 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 398 transitions. Word has length 108 [2022-07-12 11:03:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:09,151 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 398 transitions. [2022-07-12 11:03:09,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 11:03:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 398 transitions. [2022-07-12 11:03:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 11:03:09,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:09,153 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:09,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-12 11:03:09,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-07-12 11:03:09,367 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:09,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1767868658, now seen corresponding path program 1 times [2022-07-12 11:03:09,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:09,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624549322] [2022-07-12 11:03:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:03:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:03:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:03:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:03:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:03:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:03:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:03:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:03:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 11:03:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:09,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624549322] [2022-07-12 11:03:09,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624549322] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:09,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249814839] [2022-07-12 11:03:09,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:09,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:09,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:09,724 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:09,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 11:03:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 2712 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 11:03:10,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:10,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:03:10,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:03:10,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:10,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:03:10,670 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 11:03:10,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 11:03:10,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 11:03:12,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 11:03:15,153 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 11:03:15,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2022-07-12 11:03:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 11:03:15,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:15,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3024 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3024) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) is different from false [2022-07-12 11:03:15,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249814839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:15,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:03:15,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2022-07-12 11:03:15,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102659749] [2022-07-12 11:03:15,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:15,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 11:03:15,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:15,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 11:03:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1003, Unknown=2, NotChecked=64, Total=1190 [2022-07-12 11:03:15,324 INFO L87 Difference]: Start difference. First operand 323 states and 398 transitions. Second operand has 32 states, 30 states have (on average 3.433333333333333) internal successors, (103), 28 states have internal predecessors, (103), 11 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) [2022-07-12 11:03:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:18,476 INFO L93 Difference]: Finished difference Result 436 states and 523 transitions. [2022-07-12 11:03:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 11:03:18,477 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.433333333333333) internal successors, (103), 28 states have internal predecessors, (103), 11 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) Word has length 114 [2022-07-12 11:03:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:18,478 INFO L225 Difference]: With dead ends: 436 [2022-07-12 11:03:18,478 INFO L226 Difference]: Without dead ends: 309 [2022-07-12 11:03:18,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 192 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=270, Invalid=2281, Unknown=3, NotChecked=98, Total=2652 [2022-07-12 11:03:18,480 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 82 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 436 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:18,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 767 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1039 Invalid, 0 Unknown, 436 Unchecked, 0.7s Time] [2022-07-12 11:03:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-12 11:03:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2022-07-12 11:03:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 205 states have (on average 1.0731707317073171) internal successors, (220), 209 states have internal predecessors, (220), 72 states have call successors, (72), 31 states have call predecessors, (72), 31 states have return successors, (79), 68 states have call predecessors, (79), 69 states have call successors, (79) [2022-07-12 11:03:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 371 transitions. [2022-07-12 11:03:18,534 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 371 transitions. Word has length 114 [2022-07-12 11:03:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:18,534 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 371 transitions. [2022-07-12 11:03:18,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.433333333333333) internal successors, (103), 28 states have internal predecessors, (103), 11 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) [2022-07-12 11:03:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 371 transitions. [2022-07-12 11:03:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 11:03:18,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:18,535 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:18,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-07-12 11:03:18,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-12 11:03:18,736 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:18,736 INFO L85 PathProgramCache]: Analyzing trace with hash -329161806, now seen corresponding path program 1 times [2022-07-12 11:03:18,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:18,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68453858] [2022-07-12 11:03:18,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:18,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:03:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:03:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:03:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:03:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:03:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:03:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:03:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:03:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:03:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-12 11:03:19,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:19,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68453858] [2022-07-12 11:03:19,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68453858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:19,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:19,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-12 11:03:19,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558225807] [2022-07-12 11:03:19,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:19,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 11:03:19,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:19,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 11:03:19,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:03:19,397 INFO L87 Difference]: Start difference. First operand 309 states and 371 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-12 11:03:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:21,335 INFO L93 Difference]: Finished difference Result 339 states and 406 transitions. [2022-07-12 11:03:21,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:03:21,340 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 117 [2022-07-12 11:03:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:21,341 INFO L225 Difference]: With dead ends: 339 [2022-07-12 11:03:21,341 INFO L226 Difference]: Without dead ends: 323 [2022-07-12 11:03:21,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2022-07-12 11:03:21,342 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 146 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:21,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 415 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 11:03:21,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-12 11:03:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 309. [2022-07-12 11:03:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 205 states have (on average 1.0682926829268293) internal successors, (219), 209 states have internal predecessors, (219), 72 states have call successors, (72), 31 states have call predecessors, (72), 31 states have return successors, (79), 68 states have call predecessors, (79), 69 states have call successors, (79) [2022-07-12 11:03:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 370 transitions. [2022-07-12 11:03:21,402 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 370 transitions. Word has length 117 [2022-07-12 11:03:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:21,402 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 370 transitions. [2022-07-12 11:03:21,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-12 11:03:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 370 transitions. [2022-07-12 11:03:21,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 11:03:21,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:21,403 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:21,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-12 11:03:21,403 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash -110307088, now seen corresponding path program 1 times [2022-07-12 11:03:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:21,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177425982] [2022-07-12 11:03:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:21,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:03:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:03:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:03:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:03:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:03:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:03:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:03:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:03:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:03:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-12 11:03:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:22,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177425982] [2022-07-12 11:03:22,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177425982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:22,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:22,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:03:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350473152] [2022-07-12 11:03:22,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:22,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:03:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:03:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:03:22,006 INFO L87 Difference]: Start difference. First operand 309 states and 370 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-12 11:03:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:23,212 INFO L93 Difference]: Finished difference Result 325 states and 387 transitions. [2022-07-12 11:03:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:03:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 117 [2022-07-12 11:03:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:23,213 INFO L225 Difference]: With dead ends: 325 [2022-07-12 11:03:23,213 INFO L226 Difference]: Without dead ends: 282 [2022-07-12 11:03:23,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-07-12 11:03:23,214 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 91 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:23,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 369 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:03:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-12 11:03:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-07-12 11:03:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 191 states have (on average 1.0628272251308901) internal successors, (203), 195 states have internal predecessors, (203), 60 states have call successors, (60), 30 states have call predecessors, (60), 30 states have return successors, (67), 56 states have call predecessors, (67), 57 states have call successors, (67) [2022-07-12 11:03:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 330 transitions. [2022-07-12 11:03:23,264 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 330 transitions. Word has length 117 [2022-07-12 11:03:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:23,264 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 330 transitions. [2022-07-12 11:03:23,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-12 11:03:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 330 transitions. [2022-07-12 11:03:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 11:03:23,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:23,265 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:23,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-12 11:03:23,266 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:23,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1577419131, now seen corresponding path program 1 times [2022-07-12 11:03:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:23,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914767120] [2022-07-12 11:03:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:03:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:03:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:03:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:03:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:03:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:03:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:03:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:03:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:03:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:03:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:03:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-07-12 11:03:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:23,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914767120] [2022-07-12 11:03:23,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914767120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:23,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:23,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 11:03:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516146379] [2022-07-12 11:03:23,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:23,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 11:03:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 11:03:23,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:03:23,968 INFO L87 Difference]: Start difference. First operand 282 states and 330 transitions. Second operand has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-12 11:03:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:24,762 INFO L93 Difference]: Finished difference Result 290 states and 337 transitions. [2022-07-12 11:03:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:03:24,762 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 119 [2022-07-12 11:03:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:24,763 INFO L225 Difference]: With dead ends: 290 [2022-07-12 11:03:24,763 INFO L226 Difference]: Without dead ends: 203 [2022-07-12 11:03:24,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-07-12 11:03:24,764 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:24,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 242 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:03:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-12 11:03:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-07-12 11:03:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 135 states have (on average 1.0740740740740742) internal successors, (145), 138 states have internal predecessors, (145), 48 states have call successors, (48), 20 states have call predecessors, (48), 19 states have return successors, (54), 44 states have call predecessors, (54), 45 states have call successors, (54) [2022-07-12 11:03:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 247 transitions. [2022-07-12 11:03:24,798 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 247 transitions. Word has length 119 [2022-07-12 11:03:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:24,798 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 247 transitions. [2022-07-12 11:03:24,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-12 11:03:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 247 transitions. [2022-07-12 11:03:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 11:03:24,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:24,799 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:24,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-12 11:03:24,799 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:24,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash -362342817, now seen corresponding path program 2 times [2022-07-12 11:03:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:24,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792296690] [2022-07-12 11:03:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:24,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:03:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:03:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:03:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:03:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:03:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:03:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:03:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:03:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-12 11:03:25,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:25,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792296690] [2022-07-12 11:03:25,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792296690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:25,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968746913] [2022-07-12 11:03:25,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:03:25,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:25,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:25,283 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:25,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-12 11:03:26,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:03:26,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:03:26,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 2734 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 11:03:26,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:26,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:03:26,196 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:03:26,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:03:26,285 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-12 11:03:26,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-07-12 11:03:26,331 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:03:26,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:03:28,623 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:03:28,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 11:03:28,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-12 11:03:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 11:03:32,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:33,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3267 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_3267) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) is different from false [2022-07-12 11:03:33,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968746913] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:33,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:03:33,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 33 [2022-07-12 11:03:33,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827236730] [2022-07-12 11:03:33,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:33,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 11:03:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:33,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 11:03:33,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=4, NotChecked=78, Total=1722 [2022-07-12 11:03:33,478 INFO L87 Difference]: Start difference. First operand 203 states and 247 transitions. Second operand has 33 states, 30 states have (on average 4.1) internal successors, (123), 29 states have internal predecessors, (123), 10 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) [2022-07-12 11:03:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:38,468 INFO L93 Difference]: Finished difference Result 339 states and 409 transitions. [2022-07-12 11:03:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 11:03:38,468 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 4.1) internal successors, (123), 29 states have internal predecessors, (123), 10 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) Word has length 120 [2022-07-12 11:03:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:38,469 INFO L225 Difference]: With dead ends: 339 [2022-07-12 11:03:38,469 INFO L226 Difference]: Without dead ends: 255 [2022-07-12 11:03:38,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 169 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=291, Invalid=2677, Unknown=6, NotChecked=106, Total=3080 [2022-07-12 11:03:38,470 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 161 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 641 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:38,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 462 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 712 Invalid, 0 Unknown, 641 Unchecked, 0.5s Time] [2022-07-12 11:03:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-12 11:03:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 215. [2022-07-12 11:03:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 147 states have (on average 1.0680272108843538) internal successors, (157), 150 states have internal predecessors, (157), 47 states have call successors, (47), 21 states have call predecessors, (47), 20 states have return successors, (52), 43 states have call predecessors, (52), 44 states have call successors, (52) [2022-07-12 11:03:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 256 transitions. [2022-07-12 11:03:38,507 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 256 transitions. Word has length 120 [2022-07-12 11:03:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:38,507 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 256 transitions. [2022-07-12 11:03:38,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 4.1) internal successors, (123), 29 states have internal predecessors, (123), 10 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) [2022-07-12 11:03:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 256 transitions. [2022-07-12 11:03:38,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 11:03:38,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:38,508 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:38,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:38,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-12 11:03:38,708 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash -913789417, now seen corresponding path program 1 times [2022-07-12 11:03:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:38,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762932470] [2022-07-12 11:03:38,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:38,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:03:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:03:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:03:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:03:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:03:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:03:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:03:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:03:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 11:03:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:39,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762932470] [2022-07-12 11:03:39,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762932470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:39,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:39,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:03:39,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031435611] [2022-07-12 11:03:39,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:39,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:03:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:03:39,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:03:39,230 INFO L87 Difference]: Start difference. First operand 215 states and 256 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 8 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-12 11:03:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:40,182 INFO L93 Difference]: Finished difference Result 267 states and 322 transitions. [2022-07-12 11:03:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:03:40,183 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 8 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 120 [2022-07-12 11:03:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:40,184 INFO L225 Difference]: With dead ends: 267 [2022-07-12 11:03:40,184 INFO L226 Difference]: Without dead ends: 239 [2022-07-12 11:03:40,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:03:40,185 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 50 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:40,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 334 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:03:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-12 11:03:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 225. [2022-07-12 11:03:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 151 states have (on average 1.0596026490066226) internal successors, (160), 154 states have internal predecessors, (160), 53 states have call successors, (53), 21 states have call predecessors, (53), 20 states have return successors, (58), 49 states have call predecessors, (58), 50 states have call successors, (58) [2022-07-12 11:03:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 271 transitions. [2022-07-12 11:03:40,224 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 271 transitions. Word has length 120 [2022-07-12 11:03:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:40,224 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 271 transitions. [2022-07-12 11:03:40,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 8 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-12 11:03:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 271 transitions. [2022-07-12 11:03:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 11:03:40,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:40,225 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:40,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-12 11:03:40,225 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash -843423075, now seen corresponding path program 1 times [2022-07-12 11:03:40,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:40,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985608974] [2022-07-12 11:03:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:03:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:03:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:03:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:03:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:03:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:03:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:03:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:03:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:03:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:03:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 11:03:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:40,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985608974] [2022-07-12 11:03:40,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985608974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:40,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608970716] [2022-07-12 11:03:40,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:40,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:40,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:40,964 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:40,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-12 11:03:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:41,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 2764 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-12 11:03:41,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:41,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:03:41,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:03:41,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:41,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:03:41,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:41,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:43,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:43,309 INFO L356 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-07-12 11:03:43,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 53 [2022-07-12 11:03:43,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-12 11:03:43,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-12 11:03:45,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-12 11:03:45,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-12 11:03:45,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:45,766 INFO L356 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-07-12 11:03:45,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2022-07-12 11:03:54,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:54,231 INFO L356 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2022-07-12 11:03:54,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 32 [2022-07-12 11:03:54,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:03:54,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:54,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-12 11:03:54,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:03:54,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:54,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-12 11:03:54,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2022-07-12 11:03:54,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:54,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2022-07-12 11:03:54,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:55,276 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 8)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22|) 8)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|)))) is different from true [2022-07-12 11:04:02,407 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23|) 8)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23|) 8)))) is different from true [2022-07-12 11:04:07,698 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24|) 8)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26|)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26|) 8)))) is different from true [2022-07-12 11:04:08,770 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25|) 8)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27|)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27|) 8)))) is different from true [2022-07-12 11:04:11,045 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8)) (.cse1 (+ |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_19| 8)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26|) 8) .cse0) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21|) .cse1) .cse0) (= .cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21|) .cse1)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|)) (= .cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26|) 8))))) is different from true [2022-07-12 11:04:13,218 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8)) (.cse1 (+ |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_20| 8)) (.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27|) 8)) (= .cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22|) .cse1)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22|) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27|) 8) .cse2) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22|)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|))))) is different from true [2022-07-12 11:04:13,377 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-12 11:04:13,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-07-12 11:04:13,382 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-12 11:04:13,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-07-12 11:04:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 72 not checked. [2022-07-12 11:04:15,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:04:17,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608970716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:04:17,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:04:17,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33] total 49 [2022-07-12 11:04:17,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040078047] [2022-07-12 11:04:17,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:04:17,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 11:04:17,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:04:17,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 11:04:17,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2127, Unknown=9, NotChecked=582, Total=2862 [2022-07-12 11:04:17,841 INFO L87 Difference]: Start difference. First operand 225 states and 271 transitions. Second operand has 49 states, 44 states have (on average 3.340909090909091) internal successors, (147), 44 states have internal predecessors, (147), 17 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (27), 14 states have call predecessors, (27), 16 states have call successors, (27)