./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_buf_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 9a96b91703f0cc76adc9b0fdbd8386a96920c1be21a810b6415a59c2166f1461 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:32:49,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:32:49,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:32:50,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:32:50,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:32:50,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:32:50,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:32:50,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:32:50,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:32:50,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:32:50,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:32:50,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:32:50,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:32:50,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:32:50,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:32:50,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:32:50,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:32:50,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:32:50,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:32:50,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:32:50,047 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:32:50,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:32:50,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:32:50,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:32:50,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:32:50,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:32:50,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:32:50,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:32:50,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:32:50,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:32:50,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:32:50,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:32:50,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:32:50,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:32:50,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:32:50,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:32:50,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:32:50,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:32:50,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:32:50,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:32:50,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:32:50,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:32:50,062 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:32:50,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:32:50,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:32:50,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:32:50,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:32:50,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:32:50,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:32:50,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:32:50,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:32:50,085 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:32:50,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:32:50,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:32:50,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:32:50,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:32:50,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:32:50,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:32:50,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:32:50,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:32:50,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:32:50,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:32:50,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:32:50,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:32:50,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:32:50,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:32:50,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:32:50,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:32:50,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:32:50,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:32:50,088 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:32:50,088 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:32:50,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:32:50,089 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 -> 9a96b91703f0cc76adc9b0fdbd8386a96920c1be21a810b6415a59c2166f1461 [2022-07-13 22:32:50,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:32:50,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:32:50,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:32:50,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:32:50,278 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:32:50,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2022-07-13 22:32:50,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d94952ac/4482b1a36c814dae903baff8aa20e5a8/FLAG2b8f3f853 [2022-07-13 22:32:50,913 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:32:50,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2022-07-13 22:32:50,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d94952ac/4482b1a36c814dae903baff8aa20e5a8/FLAG2b8f3f853 [2022-07-13 22:32:51,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d94952ac/4482b1a36c814dae903baff8aa20e5a8 [2022-07-13 22:32:51,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:32:51,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:32:51,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:32:51,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:32:51,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:32:51,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:32:51" (1/1) ... [2022-07-13 22:32:51,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd66dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:51, skipping insertion in model container [2022-07-13 22:32:51,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:32:51" (1/1) ... [2022-07-13 22:32:51,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:32:51,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:32:51,335 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_buf_advance_harness.i[4494,4507] [2022-07-13 22:32:51,341 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_buf_advance_harness.i[4554,4567] [2022-07-13 22:32:51,793 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:51,794 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:51,794 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:51,794 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:51,795 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:51,803 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:51,804 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:51,805 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:51,805 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,023 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:32:52,024 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:32:52,024 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:32:52,025 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:32:52,026 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:32:52,026 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:32:52,027 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:32:52,027 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:32:52,027 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:32:52,028 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:32:52,111 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:32:52,197 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,198 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:32:52,345 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:32:52,364 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_buf_advance_harness.i[4494,4507] [2022-07-13 22:32:52,387 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_buf_advance_harness.i[4554,4567] [2022-07-13 22:32:52,427 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,432 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,432 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,433 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,433 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,456 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,457 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,460 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,460 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,508 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:32:52,509 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:32:52,510 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:32:52,510 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:32:52,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:32:52,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:32:52,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:32:52,512 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:32:52,512 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:32:52,515 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:32:52,533 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:32:52,586 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,586 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:32:52,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:32:52,809 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:32:52,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52 WrapperNode [2022-07-13 22:32:52,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:32:52,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:32:52,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:32:52,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:32:52,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (1/1) ... [2022-07-13 22:32:52,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (1/1) ... [2022-07-13 22:32:52,971 INFO L137 Inliner]: procedures = 691, calls = 2677, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 972 [2022-07-13 22:32:52,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:32:52,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:32:52,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:32:52,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:32:52,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (1/1) ... [2022-07-13 22:32:52,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (1/1) ... [2022-07-13 22:32:52,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (1/1) ... [2022-07-13 22:32:52,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (1/1) ... [2022-07-13 22:32:53,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (1/1) ... [2022-07-13 22:32:53,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (1/1) ... [2022-07-13 22:32:53,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (1/1) ... [2022-07-13 22:32:53,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:32:53,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:32:53,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:32:53,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:32:53,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (1/1) ... [2022-07-13 22:32:53,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:32:53,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:32:53,096 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-13 22:32:53,164 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-13 22:32:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-13 22:32:53,185 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-13 22:32:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:32:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:32:53,185 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:32:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:32:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:32:53,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:32:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:32:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:32:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:32:53,187 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_buf_has_allocated_buffer_member [2022-07-13 22:32:53,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_buf_has_allocated_buffer_member [2022-07-13 22:32:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:32:53,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:32:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:32:53,188 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:32:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-13 22:32:53,188 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-13 22:32:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:32:53,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:32:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:32:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:32:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:32:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:32:53,189 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:32:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_bounded [2022-07-13 22:32:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_bounded [2022-07-13 22:32:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:32:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2022-07-13 22:32:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2022-07-13 22:32:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-07-13 22:32:53,191 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-07-13 22:32:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:32:53,422 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:32:53,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:32:54,340 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:32:54,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:32:54,347 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 22:32:54,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:32:54 BoogieIcfgContainer [2022-07-13 22:32:54,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:32:54,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:32:54,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:32:54,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:32:54,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:32:51" (1/3) ... [2022-07-13 22:32:54,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32106d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:32:54, skipping insertion in model container [2022-07-13 22:32:54,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:32:52" (2/3) ... [2022-07-13 22:32:54,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32106d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:32:54, skipping insertion in model container [2022-07-13 22:32:54,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:32:54" (3/3) ... [2022-07-13 22:32:54,355 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_advance_harness.i [2022-07-13 22:32:54,364 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:32:54,364 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:32:54,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:32:54,398 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@6fe139c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38cd27a1 [2022-07-13 22:32:54,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:32:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-13 22:32:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 22:32:54,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:32:54,409 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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-13 22:32:54,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:32:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:32:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1247030305, now seen corresponding path program 1 times [2022-07-13 22:32:54,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:32:54,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20987718] [2022-07-13 22:32:54,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:32:54,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:32:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:32:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:32:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:32:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:32:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:32:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:32:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:32:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:32:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:32:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:32:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:32:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:32:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:32:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:32:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-13 22:32:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:32:54,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20987718] [2022-07-13 22:32:54,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20987718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:32:54,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:32:54,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:32:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968979506] [2022-07-13 22:32:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:32:54,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:32:54,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:32:55,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:32:55,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:32:55,016 INFO L87 Difference]: Start difference. First operand has 173 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 22:32:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:32:55,351 INFO L93 Difference]: Finished difference Result 349 states and 522 transitions. [2022-07-13 22:32:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:32:55,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2022-07-13 22:32:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:32:55,368 INFO L225 Difference]: With dead ends: 349 [2022-07-13 22:32:55,368 INFO L226 Difference]: Without dead ends: 175 [2022-07-13 22:32:55,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:32:55,382 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 119 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:32:55,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 278 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:32:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-13 22:32:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2022-07-13 22:32:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 101 states have (on average 1.198019801980198) internal successors, (121), 102 states have internal predecessors, (121), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-13 22:32:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2022-07-13 22:32:55,431 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 89 [2022-07-13 22:32:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:32:55,432 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2022-07-13 22:32:55,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 22:32:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2022-07-13 22:32:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:32:55,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:32:55,436 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:32:55,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:32:55,436 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:32:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:32:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1477386906, now seen corresponding path program 1 times [2022-07-13 22:32:55,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:32:55,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516581877] [2022-07-13 22:32:55,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:32:55,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:32:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:32:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:32:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:32:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:32:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:32:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:32:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:32:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:32:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:32:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:32:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:32:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:32:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:32:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:32:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:32:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-13 22:32:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:32:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516581877] [2022-07-13 22:32:55,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516581877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:32:55,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012589040] [2022-07-13 22:32:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:32:55,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:32:55,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:32:55,799 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-13 22:32:55,803 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-13 22:32:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:56,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 2754 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:32:56,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:32:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 22:32:56,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:32:56,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012589040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:32:56,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:32:56,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-13 22:32:56,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595496863] [2022-07-13 22:32:56,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:32:56,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:32:56,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:32:56,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:32:56,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:32:56,397 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:32:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:32:56,662 INFO L93 Difference]: Finished difference Result 332 states and 462 transitions. [2022-07-13 22:32:56,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:32:56,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 96 [2022-07-13 22:32:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:32:56,664 INFO L225 Difference]: With dead ends: 332 [2022-07-13 22:32:56,664 INFO L226 Difference]: Without dead ends: 171 [2022-07-13 22:32:56,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:32:56,665 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 259 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:32:56,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 582 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:32:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-13 22:32:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-13 22:32:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 105 states have internal predecessors, (123), 55 states have call successors, (55), 11 states have call predecessors, (55), 12 states have return successors, (63), 54 states have call predecessors, (63), 54 states have call successors, (63) [2022-07-13 22:32:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2022-07-13 22:32:56,678 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 96 [2022-07-13 22:32:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:32:56,679 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2022-07-13 22:32:56,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:32:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2022-07-13 22:32:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-13 22:32:56,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:32:56,681 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:32:56,703 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-13 22:32:56,901 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-13 22:32:56,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:32:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:32:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1893468965, now seen corresponding path program 1 times [2022-07-13 22:32:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:32:56,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426827102] [2022-07-13 22:32:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:32:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:32:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:32:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:32:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:32:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:32:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:32:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:32:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:32:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:32:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:32:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:32:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:32:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:32:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:32:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:32:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:32:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-13 22:32:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:32:57,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426827102] [2022-07-13 22:32:57,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426827102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:32:57,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261252762] [2022-07-13 22:32:57,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:32:57,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:32:57,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:32:57,256 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-13 22:32:57,257 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-13 22:32:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:57,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:32:57,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:32:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 22:32:57,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:32:57,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261252762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:32:57,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:32:57,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-13 22:32:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691531066] [2022-07-13 22:32:57,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:32:57,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:32:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:32:57,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:32:57,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:32:57,727 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:32:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:32:58,078 INFO L93 Difference]: Finished difference Result 293 states and 416 transitions. [2022-07-13 22:32:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:32:58,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 102 [2022-07-13 22:32:58,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:32:58,081 INFO L225 Difference]: With dead ends: 293 [2022-07-13 22:32:58,081 INFO L226 Difference]: Without dead ends: 171 [2022-07-13 22:32:58,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:32:58,082 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 299 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:32:58,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 695 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:32:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-13 22:32:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-13 22:32:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 105 states have internal predecessors, (123), 55 states have call successors, (55), 11 states have call predecessors, (55), 12 states have return successors, (60), 54 states have call predecessors, (60), 54 states have call successors, (60) [2022-07-13 22:32:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 238 transitions. [2022-07-13 22:32:58,094 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 238 transitions. Word has length 102 [2022-07-13 22:32:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:32:58,094 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 238 transitions. [2022-07-13 22:32:58,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:32:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 238 transitions. [2022-07-13 22:32:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 22:32:58,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:32:58,096 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:32:58,131 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-13 22:32:58,315 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-13 22:32:58,315 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:32:58,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:32:58,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1871994096, now seen corresponding path program 2 times [2022-07-13 22:32:58,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:32:58,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001784976] [2022-07-13 22:32:58,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:32:58,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:32:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:32:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:32:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:32:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:32:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:32:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:32:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:32:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:32:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:32:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:32:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:32:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:32:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:32:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:32:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:32:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-13 22:32:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:32:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001784976] [2022-07-13 22:32:58,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001784976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:32:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446615097] [2022-07-13 22:32:58,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:32:58,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:32:58,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:32:58,632 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-13 22:32:58,652 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-13 22:32:59,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 22:32:59,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:32:59,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 2390 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:32:59,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:32:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 22:32:59,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:32:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-13 22:32:59,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446615097] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:32:59,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:32:59,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 14 [2022-07-13 22:32:59,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621078348] [2022-07-13 22:32:59,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:32:59,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:32:59,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:32:59,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:32:59,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:32:59,302 INFO L87 Difference]: Start difference. First operand 171 states and 238 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:32:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:32:59,388 INFO L93 Difference]: Finished difference Result 256 states and 358 transitions. [2022-07-13 22:32:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:32:59,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 108 [2022-07-13 22:32:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:32:59,390 INFO L225 Difference]: With dead ends: 256 [2022-07-13 22:32:59,390 INFO L226 Difference]: Without dead ends: 171 [2022-07-13 22:32:59,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:32:59,391 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 229 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:32:59,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 813 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:32:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-13 22:32:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-13 22:32:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 105 states have internal predecessors, (123), 55 states have call successors, (55), 11 states have call predecessors, (55), 12 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2022-07-13 22:32:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 237 transitions. [2022-07-13 22:32:59,402 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 237 transitions. Word has length 108 [2022-07-13 22:32:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:32:59,402 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 237 transitions. [2022-07-13 22:32:59,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:32:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 237 transitions. [2022-07-13 22:32:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-13 22:32:59,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:32:59,404 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:32:59,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 22:32:59,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:32:59,621 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:32:59,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:32:59,621 INFO L85 PathProgramCache]: Analyzing trace with hash -225220613, now seen corresponding path program 3 times [2022-07-13 22:32:59,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:32:59,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538620471] [2022-07-13 22:32:59,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:32:59,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:32:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:32:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:32:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:32:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:32:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:32:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:32:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:32:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:32:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:32:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:32:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:32:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:32:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:32:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:32:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:32:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:32:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 22:32:59,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:32:59,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538620471] [2022-07-13 22:32:59,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538620471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:32:59,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364948066] [2022-07-13 22:32:59,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 22:32:59,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:32:59,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:32:59,892 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-13 22:32:59,893 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-13 22:33:00,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-13 22:33:00,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:33:00,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 2407 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 22:33:00,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:00,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:00,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:00,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:00,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-13 22:33:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 22:33:00,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:00,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364948066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:00,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:00,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-07-13 22:33:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745604599] [2022-07-13 22:33:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:00,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:33:00,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:00,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:33:00,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:33:00,517 INFO L87 Difference]: Start difference. First operand 171 states and 237 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:00,562 INFO L93 Difference]: Finished difference Result 282 states and 390 transitions. [2022-07-13 22:33:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:33:00,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2022-07-13 22:33:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:00,564 INFO L225 Difference]: With dead ends: 282 [2022-07-13 22:33:00,564 INFO L226 Difference]: Without dead ends: 190 [2022-07-13 22:33:00,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:33:00,565 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 37 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:00,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 720 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 60 Unchecked, 0.0s Time] [2022-07-13 22:33:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-13 22:33:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2022-07-13 22:33:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 121 states have internal predecessors, (142), 56 states have call successors, (56), 12 states have call predecessors, (56), 13 states have return successors, (61), 54 states have call predecessors, (61), 55 states have call successors, (61) [2022-07-13 22:33:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 259 transitions. [2022-07-13 22:33:00,575 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 259 transitions. Word has length 114 [2022-07-13 22:33:00,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:00,576 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 259 transitions. [2022-07-13 22:33:00,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 259 transitions. [2022-07-13 22:33:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-13 22:33:00,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:00,577 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:00,605 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-13 22:33:00,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:00,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash -812026627, now seen corresponding path program 1 times [2022-07-13 22:33:00,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:00,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471434212] [2022-07-13 22:33:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:33:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:33:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:33:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:33:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:33:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 22:33:01,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:01,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471434212] [2022-07-13 22:33:01,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471434212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:01,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378283052] [2022-07-13 22:33:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:01,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:01,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:01,030 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-13 22:33:01,070 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-13 22:33:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:33:01,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-13 22:33:01,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:01,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378283052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:01,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:01,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-13 22:33:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173518099] [2022-07-13 22:33:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:01,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:33:01,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:01,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:33:01,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:33:01,462 INFO L87 Difference]: Start difference. First operand 188 states and 259 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:01,486 INFO L93 Difference]: Finished difference Result 393 states and 553 transitions. [2022-07-13 22:33:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:33:01,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2022-07-13 22:33:01,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:01,488 INFO L225 Difference]: With dead ends: 393 [2022-07-13 22:33:01,488 INFO L226 Difference]: Without dead ends: 212 [2022-07-13 22:33:01,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:33:01,490 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 28 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:01,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 718 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:33:01,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-13 22:33:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 190. [2022-07-13 22:33:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 123 states have internal predecessors, (143), 56 states have call successors, (56), 12 states have call predecessors, (56), 13 states have return successors, (61), 54 states have call predecessors, (61), 55 states have call successors, (61) [2022-07-13 22:33:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 260 transitions. [2022-07-13 22:33:01,498 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 260 transitions. Word has length 114 [2022-07-13 22:33:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:01,499 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 260 transitions. [2022-07-13 22:33:01,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:01,499 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 260 transitions. [2022-07-13 22:33:01,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-13 22:33:01,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:01,500 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:01,524 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-13 22:33:01,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:01,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:01,716 INFO L85 PathProgramCache]: Analyzing trace with hash -110962049, now seen corresponding path program 1 times [2022-07-13 22:33:01,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:01,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39759648] [2022-07-13 22:33:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:01,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:33:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:33:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:33:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:33:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:33:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 22:33:01,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:01,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39759648] [2022-07-13 22:33:01,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39759648] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:01,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145667046] [2022-07-13 22:33:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:01,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:01,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:01,957 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-13 22:33:01,958 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-13 22:33:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 2797 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:33:02,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-13 22:33:02,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:02,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145667046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:02,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:02,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-13 22:33:02,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381763767] [2022-07-13 22:33:02,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:02,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:33:02,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:02,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:33:02,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:33:02,381 INFO L87 Difference]: Start difference. First operand 190 states and 260 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:02,405 INFO L93 Difference]: Finished difference Result 381 states and 533 transitions. [2022-07-13 22:33:02,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:33:02,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2022-07-13 22:33:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:02,407 INFO L225 Difference]: With dead ends: 381 [2022-07-13 22:33:02,407 INFO L226 Difference]: Without dead ends: 198 [2022-07-13 22:33:02,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:33:02,409 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 20 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:02,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 682 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:33:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-13 22:33:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 182. [2022-07-13 22:33:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 115 states have internal predecessors, (135), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (60), 54 states have call predecessors, (60), 55 states have call successors, (60) [2022-07-13 22:33:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2022-07-13 22:33:02,419 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 251 transitions. Word has length 114 [2022-07-13 22:33:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:02,419 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-07-13 22:33:02,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2022-07-13 22:33:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-13 22:33:02,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:02,421 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:02,443 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-13 22:33:02,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:02,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:02,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2075601977, now seen corresponding path program 1 times [2022-07-13 22:33:02,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:02,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081614168] [2022-07-13 22:33:02,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:33:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:33:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:33:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:33:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:33:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 22:33:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:02,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081614168] [2022-07-13 22:33:02,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081614168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:02,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723411271] [2022-07-13 22:33:02,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:02,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:02,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:02,898 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-13 22:33:02,909 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-13 22:33:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:03,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:33:03,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 22:33:03,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:03,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723411271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:03,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:03,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-13 22:33:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571508863] [2022-07-13 22:33:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:03,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:33:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:33:03,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:33:03,412 INFO L87 Difference]: Start difference. First operand 182 states and 251 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:33:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:03,670 INFO L93 Difference]: Finished difference Result 324 states and 450 transitions. [2022-07-13 22:33:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:33:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 114 [2022-07-13 22:33:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:03,672 INFO L225 Difference]: With dead ends: 324 [2022-07-13 22:33:03,672 INFO L226 Difference]: Without dead ends: 179 [2022-07-13 22:33:03,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:33:03,673 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 298 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:03,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 556 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:33:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-13 22:33:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-07-13 22:33:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 112 states have internal predecessors, (132), 56 states have call successors, (56), 12 states have call predecessors, (56), 11 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-13 22:33:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 243 transitions. [2022-07-13 22:33:03,683 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 243 transitions. Word has length 114 [2022-07-13 22:33:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:03,684 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 243 transitions. [2022-07-13 22:33:03,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:33:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 243 transitions. [2022-07-13 22:33:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 22:33:03,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:03,685 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:03,709 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-13 22:33:03,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:03,906 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:03,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1603675154, now seen corresponding path program 1 times [2022-07-13 22:33:03,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:03,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489431622] [2022-07-13 22:33:03,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:03,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:33:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:33:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:33:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:33:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:33:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:33:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-13 22:33:04,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:04,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489431622] [2022-07-13 22:33:04,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489431622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:04,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:33:04,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:33:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166682163] [2022-07-13 22:33:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:04,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:33:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:04,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:33:04,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:33:04,251 INFO L87 Difference]: Start difference. First operand 179 states and 243 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:04,765 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2022-07-13 22:33:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:33:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2022-07-13 22:33:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:04,767 INFO L225 Difference]: With dead ends: 198 [2022-07-13 22:33:04,767 INFO L226 Difference]: Without dead ends: 196 [2022-07-13 22:33:04,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:33:04,768 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 141 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:04,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 966 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:33:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-13 22:33:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2022-07-13 22:33:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 117 states have (on average 1.1794871794871795) internal successors, (138), 119 states have internal predecessors, (138), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (67), 55 states have call predecessors, (67), 56 states have call successors, (67) [2022-07-13 22:33:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 262 transitions. [2022-07-13 22:33:04,778 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 262 transitions. Word has length 120 [2022-07-13 22:33:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:04,778 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 262 transitions. [2022-07-13 22:33:04,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 262 transitions. [2022-07-13 22:33:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 22:33:04,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:04,780 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:04,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 22:33:04,780 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:04,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:04,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1437147720, now seen corresponding path program 1 times [2022-07-13 22:33:04,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:04,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051018137] [2022-07-13 22:33:04,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:04,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:33:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:33:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:33:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:33:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:33:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:33:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 22:33:05,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:05,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051018137] [2022-07-13 22:33:05,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051018137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:05,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:33:05,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:33:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537423106] [2022-07-13 22:33:05,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:05,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:33:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:33:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:33:05,116 INFO L87 Difference]: Start difference. First operand 188 states and 262 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:05,636 INFO L93 Difference]: Finished difference Result 395 states and 567 transitions. [2022-07-13 22:33:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:33:05,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2022-07-13 22:33:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:05,637 INFO L225 Difference]: With dead ends: 395 [2022-07-13 22:33:05,637 INFO L226 Difference]: Without dead ends: 214 [2022-07-13 22:33:05,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:33:05,639 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 194 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:05,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 579 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:33:05,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-13 22:33:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 191. [2022-07-13 22:33:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 120 states have (on average 1.175) internal successors, (141), 122 states have internal predecessors, (141), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (67), 55 states have call predecessors, (67), 56 states have call successors, (67) [2022-07-13 22:33:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 265 transitions. [2022-07-13 22:33:05,649 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 265 transitions. Word has length 124 [2022-07-13 22:33:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:05,649 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 265 transitions. [2022-07-13 22:33:05,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 265 transitions. [2022-07-13 22:33:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 22:33:05,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:05,651 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:05,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:33:05,651 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1178982282, now seen corresponding path program 1 times [2022-07-13 22:33:05,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:05,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478107935] [2022-07-13 22:33:05,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:05,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:33:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:33:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:33:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:33:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:33:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:05,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:33:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 22:33:06,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:06,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478107935] [2022-07-13 22:33:06,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478107935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:06,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:33:06,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:33:06,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25122693] [2022-07-13 22:33:06,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:06,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:33:06,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:06,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:33:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:33:06,102 INFO L87 Difference]: Start difference. First operand 191 states and 265 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:06,846 INFO L93 Difference]: Finished difference Result 356 states and 516 transitions. [2022-07-13 22:33:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:33:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2022-07-13 22:33:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:06,848 INFO L225 Difference]: With dead ends: 356 [2022-07-13 22:33:06,848 INFO L226 Difference]: Without dead ends: 261 [2022-07-13 22:33:06,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:33:06,849 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 248 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:06,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 897 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:33:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-13 22:33:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 201. [2022-07-13 22:33:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 129 states have (on average 1.1705426356589148) internal successors, (151), 132 states have internal predecessors, (151), 57 states have call successors, (57), 13 states have call predecessors, (57), 14 states have return successors, (78), 55 states have call predecessors, (78), 56 states have call successors, (78) [2022-07-13 22:33:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 286 transitions. [2022-07-13 22:33:06,865 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 286 transitions. Word has length 124 [2022-07-13 22:33:06,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:06,865 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 286 transitions. [2022-07-13 22:33:06,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 286 transitions. [2022-07-13 22:33:06,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 22:33:06,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:06,867 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:06,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 22:33:06,867 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:06,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1836121336, now seen corresponding path program 1 times [2022-07-13 22:33:06,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:06,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854997095] [2022-07-13 22:33:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:06,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:33:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:33:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:33:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:33:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:33:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:33:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 22:33:07,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:07,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854997095] [2022-07-13 22:33:07,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854997095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:07,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930356093] [2022-07-13 22:33:07,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:07,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:07,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:07,640 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-13 22:33:07,693 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-13 22:33:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:08,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 2824 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 22:33:08,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:08,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:08,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:08,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:08,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-13 22:33:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-13 22:33:08,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:08,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930356093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:08,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:08,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-07-13 22:33:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955569179] [2022-07-13 22:33:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:08,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:33:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:08,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:33:08,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:33:08,532 INFO L87 Difference]: Start difference. First operand 201 states and 286 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:08,590 INFO L93 Difference]: Finished difference Result 316 states and 444 transitions. [2022-07-13 22:33:08,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:33:08,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2022-07-13 22:33:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:08,591 INFO L225 Difference]: With dead ends: 316 [2022-07-13 22:33:08,591 INFO L226 Difference]: Without dead ends: 208 [2022-07-13 22:33:08,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:33:08,592 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 13 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:08,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 855 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2022-07-13 22:33:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-13 22:33:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-13 22:33:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 134 states have (on average 1.164179104477612) internal successors, (156), 137 states have internal predecessors, (156), 57 states have call successors, (57), 13 states have call predecessors, (57), 14 states have return successors, (78), 55 states have call predecessors, (78), 56 states have call successors, (78) [2022-07-13 22:33:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 291 transitions. [2022-07-13 22:33:08,605 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 291 transitions. Word has length 124 [2022-07-13 22:33:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:08,606 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 291 transitions. [2022-07-13 22:33:08,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2022-07-13 22:33:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 22:33:08,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:08,609 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:08,630 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-13 22:33:08,830 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,SelfDestructingSolverStorable11 [2022-07-13 22:33:08,830 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:08,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:08,830 INFO L85 PathProgramCache]: Analyzing trace with hash -10392004, now seen corresponding path program 1 times [2022-07-13 22:33:08,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:08,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995911189] [2022-07-13 22:33:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:08,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:33:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:33:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:33:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:33:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:33:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:33:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-13 22:33:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:09,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995911189] [2022-07-13 22:33:09,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995911189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:09,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742641671] [2022-07-13 22:33:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:09,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:09,448 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-13 22:33:09,449 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-13 22:33:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:09,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 2826 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 22:33:09,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:09,968 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-13 22:33:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 22:33:10,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:10,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742641671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:10,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:10,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 25 [2022-07-13 22:33:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494758400] [2022-07-13 22:33:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:10,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:33:10,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:10,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:33:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:33:10,160 INFO L87 Difference]: Start difference. First operand 206 states and 291 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 22:33:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:10,312 INFO L93 Difference]: Finished difference Result 422 states and 588 transitions. [2022-07-13 22:33:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 22:33:10,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 124 [2022-07-13 22:33:10,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:10,314 INFO L225 Difference]: With dead ends: 422 [2022-07-13 22:33:10,314 INFO L226 Difference]: Without dead ends: 219 [2022-07-13 22:33:10,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:33:10,315 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 75 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:10,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1318 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-13 22:33:10,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-13 22:33:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2022-07-13 22:33:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 141 states have (on average 1.1702127659574468) internal successors, (165), 143 states have internal predecessors, (165), 57 states have call successors, (57), 14 states have call predecessors, (57), 14 states have return successors, (77), 55 states have call predecessors, (77), 56 states have call successors, (77) [2022-07-13 22:33:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 299 transitions. [2022-07-13 22:33:10,327 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 299 transitions. Word has length 124 [2022-07-13 22:33:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:10,327 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 299 transitions. [2022-07-13 22:33:10,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 22:33:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 299 transitions. [2022-07-13 22:33:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 22:33:10,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:10,329 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:10,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 22:33:10,549 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,SelfDestructingSolverStorable12 [2022-07-13 22:33:10,550 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:10,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1190017078, now seen corresponding path program 1 times [2022-07-13 22:33:10,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:10,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283247881] [2022-07-13 22:33:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:33:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:33:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:33:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:33:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:33:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:33:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:33:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:33:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-13 22:33:10,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:10,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283247881] [2022-07-13 22:33:10,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283247881] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:10,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947724570] [2022-07-13 22:33:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:10,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:10,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:10,856 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-13 22:33:10,869 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-13 22:33:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:11,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 2833 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 22:33:11,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:11,436 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-13 22:33:11,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:11,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:11,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:11,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2022-07-13 22:33:11,640 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 22 treesize of output 14 [2022-07-13 22:33:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 22:33:11,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:11,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947724570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:11,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:11,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2022-07-13 22:33:11,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941920038] [2022-07-13 22:33:11,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:11,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:33:11,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:11,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:33:11,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:33:11,963 INFO L87 Difference]: Start difference. First operand 213 states and 299 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 states have internal predecessors, (79), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-13 22:33:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:12,234 INFO L93 Difference]: Finished difference Result 514 states and 750 transitions. [2022-07-13 22:33:12,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:33:12,235 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 states have internal predecessors, (79), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 128 [2022-07-13 22:33:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:12,236 INFO L225 Difference]: With dead ends: 514 [2022-07-13 22:33:12,236 INFO L226 Difference]: Without dead ends: 360 [2022-07-13 22:33:12,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 134 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:33:12,237 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 85 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:12,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 2113 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 154 Unchecked, 0.2s Time] [2022-07-13 22:33:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-13 22:33:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 263. [2022-07-13 22:33:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 182 states have (on average 1.1868131868131868) internal successors, (216), 185 states have internal predecessors, (216), 62 states have call successors, (62), 17 states have call predecessors, (62), 18 states have return successors, (88), 60 states have call predecessors, (88), 61 states have call successors, (88) [2022-07-13 22:33:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 366 transitions. [2022-07-13 22:33:12,252 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 366 transitions. Word has length 128 [2022-07-13 22:33:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:12,253 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 366 transitions. [2022-07-13 22:33:12,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 states have internal predecessors, (79), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-13 22:33:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 366 transitions. [2022-07-13 22:33:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 22:33:12,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:12,254 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:12,294 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-13 22:33:12,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 22:33:12,468 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 955701423, now seen corresponding path program 1 times [2022-07-13 22:33:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:12,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979575579] [2022-07-13 22:33:12,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:12,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:33:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:33:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:33:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-13 22:33:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:12,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979575579] [2022-07-13 22:33:12,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979575579] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:12,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234979257] [2022-07-13 22:33:12,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:12,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:12,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:12,684 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-13 22:33:12,735 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-13 22:33:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:33:13,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-13 22:33:13,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:13,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234979257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:13,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:13,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-13 22:33:13,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200409274] [2022-07-13 22:33:13,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:13,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:33:13,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:13,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:33:13,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:33:13,208 INFO L87 Difference]: Start difference. First operand 263 states and 366 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:13,245 INFO L93 Difference]: Finished difference Result 525 states and 750 transitions. [2022-07-13 22:33:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:33:13,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2022-07-13 22:33:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:13,247 INFO L225 Difference]: With dead ends: 525 [2022-07-13 22:33:13,247 INFO L226 Difference]: Without dead ends: 269 [2022-07-13 22:33:13,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:33:13,249 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:13,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 672 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:33:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-13 22:33:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 252. [2022-07-13 22:33:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 171 states have (on average 1.1695906432748537) internal successors, (200), 174 states have internal predecessors, (200), 62 states have call successors, (62), 17 states have call predecessors, (62), 18 states have return successors, (85), 60 states have call predecessors, (85), 61 states have call successors, (85) [2022-07-13 22:33:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 347 transitions. [2022-07-13 22:33:13,263 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 347 transitions. Word has length 130 [2022-07-13 22:33:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:13,263 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 347 transitions. [2022-07-13 22:33:13,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 347 transitions. [2022-07-13 22:33:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 22:33:13,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:13,264 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:13,288 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-13 22:33:13,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 22:33:13,479 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:13,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 78959785, now seen corresponding path program 1 times [2022-07-13 22:33:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:13,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693448115] [2022-07-13 22:33:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:13,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:33:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:33:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:33:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-13 22:33:13,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:13,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693448115] [2022-07-13 22:33:13,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693448115] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:13,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993583097] [2022-07-13 22:33:13,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:13,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:13,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:13,963 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-13 22:33:13,965 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-13 22:33:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:14,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 2840 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-13 22:33:14,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:14,536 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-13 22:33:14,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:14,799 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 22 treesize of output 23 [2022-07-13 22:33:14,801 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-13 22:33:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 102 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 22:33:15,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:33:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 10 proven. 44 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-13 22:33:15,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993583097] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:33:15,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:33:15,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 36 [2022-07-13 22:33:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335480569] [2022-07-13 22:33:15,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:33:15,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-13 22:33:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-13 22:33:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 22:33:15,591 INFO L87 Difference]: Start difference. First operand 252 states and 347 transitions. Second operand has 36 states, 35 states have (on average 4.571428571428571) internal successors, (160), 33 states have internal predecessors, (160), 12 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-13 22:33:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:23,309 INFO L93 Difference]: Finished difference Result 820 states and 1259 transitions. [2022-07-13 22:33:23,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-13 22:33:23,310 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.571428571428571) internal successors, (160), 33 states have internal predecessors, (160), 12 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) Word has length 130 [2022-07-13 22:33:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:23,313 INFO L225 Difference]: With dead ends: 820 [2022-07-13 22:33:23,313 INFO L226 Difference]: Without dead ends: 661 [2022-07-13 22:33:23,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 273 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2158 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=757, Invalid=6897, Unknown=2, NotChecked=0, Total=7656 [2022-07-13 22:33:23,315 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 465 mSDsluCounter, 3555 mSDsCounter, 0 mSdLazyCounter, 7776 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 3921 SdHoareTripleChecker+Invalid, 9054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 7776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 871 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:23,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 3921 Invalid, 9054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 7776 Invalid, 0 Unknown, 871 Unchecked, 5.7s Time] [2022-07-13 22:33:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-13 22:33:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 478. [2022-07-13 22:33:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 319 states have (on average 1.1755485893416928) internal successors, (375), 327 states have internal predecessors, (375), 129 states have call successors, (129), 23 states have call predecessors, (129), 29 states have return successors, (184), 127 states have call predecessors, (184), 128 states have call successors, (184) [2022-07-13 22:33:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 688 transitions. [2022-07-13 22:33:23,344 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 688 transitions. Word has length 130 [2022-07-13 22:33:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:23,345 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 688 transitions. [2022-07-13 22:33:23,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.571428571428571) internal successors, (160), 33 states have internal predecessors, (160), 12 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-13 22:33:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 688 transitions. [2022-07-13 22:33:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-13 22:33:23,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:23,347 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:23,369 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-13 22:33:23,559 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,SelfDestructingSolverStorable15 [2022-07-13 22:33:23,559 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:23,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1718133808, now seen corresponding path program 2 times [2022-07-13 22:33:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:23,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626817441] [2022-07-13 22:33:23,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:23,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:33:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:33:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:33:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:33:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:33:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:33:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:33:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:33:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 22:33:23,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:23,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626817441] [2022-07-13 22:33:23,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626817441] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:23,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85934760] [2022-07-13 22:33:23,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:33:23,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:23,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:23,810 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-13 22:33:23,811 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-13 22:33:24,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 22:33:24,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:33:24,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 2411 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 22:33:24,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:24,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:24,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:24,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:24,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-13 22:33:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 22:33:24,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:24,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85934760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:24,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:24,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-13 22:33:24,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961494349] [2022-07-13 22:33:24,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:24,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:33:24,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:24,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:33:24,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:33:24,524 INFO L87 Difference]: Start difference. First operand 478 states and 688 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:24,589 INFO L93 Difference]: Finished difference Result 602 states and 856 transitions. [2022-07-13 22:33:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:33:24,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2022-07-13 22:33:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:24,606 INFO L225 Difference]: With dead ends: 602 [2022-07-13 22:33:24,610 INFO L226 Difference]: Without dead ends: 495 [2022-07-13 22:33:24,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:33:24,612 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 25 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:24,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1081 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 140 Unchecked, 0.0s Time] [2022-07-13 22:33:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-13 22:33:24,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2022-07-13 22:33:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 335 states have (on average 1.173134328358209) internal successors, (393), 343 states have internal predecessors, (393), 129 states have call successors, (129), 24 states have call predecessors, (129), 30 states have return successors, (186), 127 states have call predecessors, (186), 128 states have call successors, (186) [2022-07-13 22:33:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 708 transitions. [2022-07-13 22:33:24,688 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 708 transitions. Word has length 132 [2022-07-13 22:33:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:24,689 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 708 transitions. [2022-07-13 22:33:24,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 708 transitions. [2022-07-13 22:33:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-13 22:33:24,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:24,707 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:24,745 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-13 22:33:24,908 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,SelfDestructingSolverStorable16 [2022-07-13 22:33:24,908 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:24,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1976299246, now seen corresponding path program 1 times [2022-07-13 22:33:24,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:24,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765374898] [2022-07-13 22:33:24,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:24,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:33:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:33:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:33:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:33:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:33:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:33:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:33:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:33:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 22:33:25,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:25,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765374898] [2022-07-13 22:33:25,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765374898] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:25,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645884547] [2022-07-13 22:33:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:25,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:25,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:25,150 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-13 22:33:25,151 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-13 22:33:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:25,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 2835 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:33:25,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-13 22:33:25,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:25,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645884547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:25,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:25,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-07-13 22:33:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270231828] [2022-07-13 22:33:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:25,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:33:25,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:25,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:33:25,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:33:25,728 INFO L87 Difference]: Start difference. First operand 495 states and 708 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:25,918 INFO L93 Difference]: Finished difference Result 942 states and 1377 transitions. [2022-07-13 22:33:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:33:25,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2022-07-13 22:33:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:25,921 INFO L225 Difference]: With dead ends: 942 [2022-07-13 22:33:25,921 INFO L226 Difference]: Without dead ends: 480 [2022-07-13 22:33:25,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:33:25,923 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 6 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:25,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 813 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-07-13 22:33:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-07-13 22:33:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2022-07-13 22:33:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 321 states have (on average 1.1651090342679127) internal successors, (374), 328 states have internal predecessors, (374), 129 states have call successors, (129), 24 states have call predecessors, (129), 29 states have return successors, (184), 127 states have call predecessors, (184), 128 states have call successors, (184) [2022-07-13 22:33:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 687 transitions. [2022-07-13 22:33:25,948 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 687 transitions. Word has length 132 [2022-07-13 22:33:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:25,948 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 687 transitions. [2022-07-13 22:33:25,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 687 transitions. [2022-07-13 22:33:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-13 22:33:25,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:25,950 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:25,972 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-13 22:33:26,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:26,163 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash 768398248, now seen corresponding path program 1 times [2022-07-13 22:33:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:26,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183474501] [2022-07-13 22:33:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:33:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:33:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:33:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:33:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:33:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:33:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:33:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:33:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 22:33:26,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:26,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183474501] [2022-07-13 22:33:26,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183474501] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:26,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993462463] [2022-07-13 22:33:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:26,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:26,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:26,446 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-13 22:33:26,476 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-13 22:33:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:26,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:33:26,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 22:33:27,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:27,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993462463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:27,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:27,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-13 22:33:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25372977] [2022-07-13 22:33:27,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:27,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:33:27,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:33:27,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:33:27,010 INFO L87 Difference]: Start difference. First operand 480 states and 687 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:33:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:27,155 INFO L93 Difference]: Finished difference Result 881 states and 1254 transitions. [2022-07-13 22:33:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:33:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2022-07-13 22:33:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:27,158 INFO L225 Difference]: With dead ends: 881 [2022-07-13 22:33:27,158 INFO L226 Difference]: Without dead ends: 409 [2022-07-13 22:33:27,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:33:27,160 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 12 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:27,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1734 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:33:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-13 22:33:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 399. [2022-07-13 22:33:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 272 states have (on average 1.1470588235294117) internal successors, (312), 280 states have internal predecessors, (312), 99 states have call successors, (99), 21 states have call predecessors, (99), 27 states have return successors, (159), 97 states have call predecessors, (159), 98 states have call successors, (159) [2022-07-13 22:33:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 570 transitions. [2022-07-13 22:33:27,182 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 570 transitions. Word has length 132 [2022-07-13 22:33:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:27,182 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 570 transitions. [2022-07-13 22:33:27,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:33:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 570 transitions. [2022-07-13 22:33:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 22:33:27,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:27,183 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:27,223 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-13 22:33:27,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:27,407 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:27,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash -984070051, now seen corresponding path program 1 times [2022-07-13 22:33:27,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:27,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450645338] [2022-07-13 22:33:27,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:27,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:33:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 22:33:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:33:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 22:33:27,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:27,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450645338] [2022-07-13 22:33:27,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450645338] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:27,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429749618] [2022-07-13 22:33:27,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:27,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:27,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:27,647 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-13 22:33:27,678 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-13 22:33:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:28,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:33:28,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-13 22:33:28,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:28,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429749618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:28,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:28,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-13 22:33:28,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545099250] [2022-07-13 22:33:28,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:28,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:33:28,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:33:28,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:33:28,224 INFO L87 Difference]: Start difference. First operand 399 states and 570 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:33:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:28,368 INFO L93 Difference]: Finished difference Result 635 states and 923 transitions. [2022-07-13 22:33:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:33:28,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2022-07-13 22:33:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:28,371 INFO L225 Difference]: With dead ends: 635 [2022-07-13 22:33:28,371 INFO L226 Difference]: Without dead ends: 404 [2022-07-13 22:33:28,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:33:28,373 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 12 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:28,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1761 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:33:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-07-13 22:33:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2022-07-13 22:33:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 270 states have (on average 1.1481481481481481) internal successors, (310), 277 states have internal predecessors, (310), 99 states have call successors, (99), 21 states have call predecessors, (99), 26 states have return successors, (152), 97 states have call predecessors, (152), 98 states have call successors, (152) [2022-07-13 22:33:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 561 transitions. [2022-07-13 22:33:28,410 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 561 transitions. Word has length 134 [2022-07-13 22:33:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:28,410 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 561 transitions. [2022-07-13 22:33:28,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:33:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 561 transitions. [2022-07-13 22:33:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 22:33:28,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:28,413 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 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-13 22:33:28,433 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-13 22:33:28,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:28,628 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2087607718, now seen corresponding path program 1 times [2022-07-13 22:33:28,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:28,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572761633] [2022-07-13 22:33:28,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:28,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:28,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:28,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:33:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:33:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:33:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:33:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:33:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 22:33:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-13 22:33:29,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:29,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572761633] [2022-07-13 22:33:29,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572761633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:29,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309718492] [2022-07-13 22:33:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:29,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:29,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:29,284 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-13 22:33:29,286 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-13 22:33:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:29,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 2883 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-13 22:33:29,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:29,830 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 10 treesize of output 8 [2022-07-13 22:33:30,094 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 22 treesize of output 22 [2022-07-13 22:33:30,119 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 23 treesize of output 11 [2022-07-13 22:33:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 22:33:30,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:30,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309718492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:30,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:30,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 25 [2022-07-13 22:33:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339544004] [2022-07-13 22:33:30,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:30,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:33:30,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:30,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:33:30,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:33:30,143 INFO L87 Difference]: Start difference. First operand 396 states and 561 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 22:33:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:30,932 INFO L93 Difference]: Finished difference Result 683 states and 1039 transitions. [2022-07-13 22:33:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:33:30,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 137 [2022-07-13 22:33:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:30,945 INFO L225 Difference]: With dead ends: 683 [2022-07-13 22:33:30,945 INFO L226 Difference]: Without dead ends: 509 [2022-07-13 22:33:30,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 157 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:33:30,947 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 155 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:30,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1745 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 833 Invalid, 0 Unknown, 106 Unchecked, 0.6s Time] [2022-07-13 22:33:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-07-13 22:33:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 412. [2022-07-13 22:33:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 283 states have (on average 1.137809187279152) internal successors, (322), 292 states have internal predecessors, (322), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (173), 97 states have call predecessors, (173), 98 states have call successors, (173) [2022-07-13 22:33:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 594 transitions. [2022-07-13 22:33:30,971 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 594 transitions. Word has length 137 [2022-07-13 22:33:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:30,972 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 594 transitions. [2022-07-13 22:33:30,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 22:33:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 594 transitions. [2022-07-13 22:33:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 22:33:30,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:30,973 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:31,019 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-13 22:33:31,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:31,194 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1691174062, now seen corresponding path program 2 times [2022-07-13 22:33:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:31,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958423826] [2022-07-13 22:33:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:33:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:33:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:33:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-07-13 22:33:31,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:31,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958423826] [2022-07-13 22:33:31,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958423826] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:31,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825346720] [2022-07-13 22:33:31,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:33:31,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:31,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:31,852 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-13 22:33:31,853 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-13 22:33:32,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 22:33:32,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:33:32,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 2414 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-13 22:33:32,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:32,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:33:32,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:32,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:33:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 22:33:32,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:32,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825346720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:32,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:32,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 24 [2022-07-13 22:33:32,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784530177] [2022-07-13 22:33:32,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:32,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:33:32,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:32,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:33:32,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:33:32,676 INFO L87 Difference]: Start difference. First operand 412 states and 594 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:32,725 INFO L93 Difference]: Finished difference Result 541 states and 770 transitions. [2022-07-13 22:33:32,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:33:32,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2022-07-13 22:33:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:32,727 INFO L225 Difference]: With dead ends: 541 [2022-07-13 22:33:32,728 INFO L226 Difference]: Without dead ends: 422 [2022-07-13 22:33:32,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:33:32,729 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 13 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:32,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1267 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 152 Unchecked, 0.0s Time] [2022-07-13 22:33:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-13 22:33:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 416. [2022-07-13 22:33:32,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (173), 97 states have call predecessors, (173), 98 states have call successors, (173) [2022-07-13 22:33:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 599 transitions. [2022-07-13 22:33:32,750 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 599 transitions. Word has length 136 [2022-07-13 22:33:32,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:32,750 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 599 transitions. [2022-07-13 22:33:32,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 599 transitions. [2022-07-13 22:33:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 22:33:32,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:32,752 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:33:32,772 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-13 22:33:32,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:32,968 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:32,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1323929556, now seen corresponding path program 3 times [2022-07-13 22:33:32,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:32,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753684529] [2022-07-13 22:33:32,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:32,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:33:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:33:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:33:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-13 22:33:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:33,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753684529] [2022-07-13 22:33:33,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753684529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:33,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:33:33,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:33:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202450467] [2022-07-13 22:33:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:33,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:33:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:33:33,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:33:33,265 INFO L87 Difference]: Start difference. First operand 416 states and 599 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:34,426 INFO L93 Difference]: Finished difference Result 601 states and 891 transitions. [2022-07-13 22:33:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:33:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2022-07-13 22:33:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:34,428 INFO L225 Difference]: With dead ends: 601 [2022-07-13 22:33:34,429 INFO L226 Difference]: Without dead ends: 490 [2022-07-13 22:33:34,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:33:34,429 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 200 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:34,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1144 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 22:33:34,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-07-13 22:33:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 416. [2022-07-13 22:33:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (172), 97 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-13 22:33:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 598 transitions. [2022-07-13 22:33:34,456 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 598 transitions. Word has length 136 [2022-07-13 22:33:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:34,456 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 598 transitions. [2022-07-13 22:33:34,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 598 transitions. [2022-07-13 22:33:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-13 22:33:34,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:34,458 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:34,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 22:33:34,458 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1902565441, now seen corresponding path program 1 times [2022-07-13 22:33:34,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:34,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096072083] [2022-07-13 22:33:34,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:34,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:33:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:33:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:33:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-13 22:33:34,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:34,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096072083] [2022-07-13 22:33:34,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096072083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:34,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:33:34,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 22:33:34,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416283271] [2022-07-13 22:33:34,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:34,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:33:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:33:34,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:33:34,682 INFO L87 Difference]: Start difference. First operand 416 states and 598 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:35,297 INFO L93 Difference]: Finished difference Result 432 states and 614 transitions. [2022-07-13 22:33:35,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 22:33:35,297 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2022-07-13 22:33:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:35,299 INFO L225 Difference]: With dead ends: 432 [2022-07-13 22:33:35,299 INFO L226 Difference]: Without dead ends: 430 [2022-07-13 22:33:35,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:33:35,301 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 154 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:35,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1186 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:33:35,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-07-13 22:33:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 416. [2022-07-13 22:33:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (172), 97 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-13 22:33:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 598 transitions. [2022-07-13 22:33:35,327 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 598 transitions. Word has length 138 [2022-07-13 22:33:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:35,327 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 598 transitions. [2022-07-13 22:33:35,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-13 22:33:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 598 transitions. [2022-07-13 22:33:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-13 22:33:35,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:35,328 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:35,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 22:33:35,329 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:35,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1201500863, now seen corresponding path program 1 times [2022-07-13 22:33:35,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:35,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503174475] [2022-07-13 22:33:35,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:35,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:35,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:35,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:35,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:35,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:33:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:33:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:33:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 16 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-13 22:33:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:36,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503174475] [2022-07-13 22:33:36,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503174475] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:36,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711647092] [2022-07-13 22:33:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:36,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:36,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:36,310 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-13 22:33:36,313 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-13 22:33:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:36,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 2854 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-13 22:33:36,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:37,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:33:37,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:37,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:33:37,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:33:37,782 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 57 treesize of output 53 [2022-07-13 22:33:37,787 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 32 treesize of output 24 [2022-07-13 22:33:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-13 22:33:37,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:33:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-13 22:33:38,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711647092] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:38,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:33:38,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [26, 25] total 57 [2022-07-13 22:33:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477254367] [2022-07-13 22:33:38,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:38,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 22:33:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 22:33:38,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3022, Unknown=0, NotChecked=0, Total=3192 [2022-07-13 22:33:38,699 INFO L87 Difference]: Start difference. First operand 416 states and 598 transitions. Second operand has 16 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:39,736 INFO L93 Difference]: Finished difference Result 481 states and 694 transitions. [2022-07-13 22:33:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:33:39,736 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2022-07-13 22:33:39,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:39,738 INFO L225 Difference]: With dead ends: 481 [2022-07-13 22:33:39,738 INFO L226 Difference]: Without dead ends: 479 [2022-07-13 22:33:39,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=239, Invalid=4183, Unknown=0, NotChecked=0, Total=4422 [2022-07-13 22:33:39,747 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 75 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:39,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 3213 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:33:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-07-13 22:33:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 416. [2022-07-13 22:33:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (172), 97 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-13 22:33:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 598 transitions. [2022-07-13 22:33:39,800 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 598 transitions. Word has length 138 [2022-07-13 22:33:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:39,800 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 598 transitions. [2022-07-13 22:33:39,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 598 transitions. [2022-07-13 22:33:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-13 22:33:39,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:39,802 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:39,823 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-13 22:33:40,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:40,015 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:40,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1335514369, now seen corresponding path program 1 times [2022-07-13 22:33:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:40,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569008032] [2022-07-13 22:33:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:33:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:33:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:33:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-13 22:33:40,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:40,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569008032] [2022-07-13 22:33:40,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569008032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:40,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:33:40,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:33:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133961598] [2022-07-13 22:33:40,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:40,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:33:40,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:40,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:33:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:33:40,286 INFO L87 Difference]: Start difference. First operand 416 states and 598 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:41,193 INFO L93 Difference]: Finished difference Result 579 states and 848 transitions. [2022-07-13 22:33:41,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:33:41,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2022-07-13 22:33:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:41,195 INFO L225 Difference]: With dead ends: 579 [2022-07-13 22:33:41,195 INFO L226 Difference]: Without dead ends: 468 [2022-07-13 22:33:41,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:33:41,202 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 117 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:41,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 937 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 22:33:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-07-13 22:33:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 415. [2022-07-13 22:33:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 98 states have call successors, (98), 22 states have call predecessors, (98), 29 states have return successors, (170), 96 states have call predecessors, (170), 97 states have call successors, (170) [2022-07-13 22:33:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 595 transitions. [2022-07-13 22:33:41,229 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 595 transitions. Word has length 138 [2022-07-13 22:33:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:41,230 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 595 transitions. [2022-07-13 22:33:41,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:33:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 595 transitions. [2022-07-13 22:33:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-13 22:33:41,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:41,231 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:41,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 22:33:41,232 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:41,232 INFO L85 PathProgramCache]: Analyzing trace with hash 148730141, now seen corresponding path program 1 times [2022-07-13 22:33:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:41,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130507924] [2022-07-13 22:33:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:33:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:33:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 22:33:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-13 22:33:41,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:41,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130507924] [2022-07-13 22:33:41,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130507924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:41,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:33:41,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:33:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733350585] [2022-07-13 22:33:41,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:41,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:33:41,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:41,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:33:41,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:33:41,434 INFO L87 Difference]: Start difference. First operand 415 states and 595 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 22:33:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:41,886 INFO L93 Difference]: Finished difference Result 588 states and 864 transitions. [2022-07-13 22:33:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:33:41,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 142 [2022-07-13 22:33:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:41,894 INFO L225 Difference]: With dead ends: 588 [2022-07-13 22:33:41,894 INFO L226 Difference]: Without dead ends: 415 [2022-07-13 22:33:41,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:33:41,898 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 85 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:41,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 795 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:33:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-13 22:33:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2022-07-13 22:33:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 287 states have (on average 1.1358885017421603) internal successors, (326), 296 states have internal predecessors, (326), 98 states have call successors, (98), 22 states have call predecessors, (98), 29 states have return successors, (170), 96 states have call predecessors, (170), 97 states have call successors, (170) [2022-07-13 22:33:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 594 transitions. [2022-07-13 22:33:41,922 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 594 transitions. Word has length 142 [2022-07-13 22:33:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:41,922 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 594 transitions. [2022-07-13 22:33:41,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 22:33:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 594 transitions. [2022-07-13 22:33:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-13 22:33:41,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:41,924 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:41,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 22:33:41,924 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash -816621186, now seen corresponding path program 1 times [2022-07-13 22:33:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:41,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629943385] [2022-07-13 22:33:41,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:41,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:33:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:33:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:33:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:33:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:33:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:33:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-07-13 22:33:42,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:42,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629943385] [2022-07-13 22:33:42,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629943385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:42,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:33:42,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:33:42,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627773214] [2022-07-13 22:33:42,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:42,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:33:42,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:42,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:33:42,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:33:42,143 INFO L87 Difference]: Start difference. First operand 415 states and 594 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 22:33:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:42,748 INFO L93 Difference]: Finished difference Result 435 states and 616 transitions. [2022-07-13 22:33:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:33:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2022-07-13 22:33:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:42,750 INFO L225 Difference]: With dead ends: 435 [2022-07-13 22:33:42,750 INFO L226 Difference]: Without dead ends: 433 [2022-07-13 22:33:42,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:33:42,751 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 192 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:42,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 977 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:33:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-13 22:33:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 422. [2022-07-13 22:33:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 290 states have (on average 1.1344827586206896) internal successors, (329), 299 states have internal predecessors, (329), 101 states have call successors, (101), 23 states have call predecessors, (101), 30 states have return successors, (173), 99 states have call predecessors, (173), 100 states have call successors, (173) [2022-07-13 22:33:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions. [2022-07-13 22:33:42,774 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 144 [2022-07-13 22:33:42,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:42,774 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions. [2022-07-13 22:33:42,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 22:33:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions. [2022-07-13 22:33:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-13 22:33:42,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:42,776 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:33:42,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 22:33:42,776 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:42,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:42,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2035479364, now seen corresponding path program 1 times [2022-07-13 22:33:42,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:42,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235530347] [2022-07-13 22:33:42,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:42,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:33:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:33:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:33:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:33:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:33:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:33:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-13 22:33:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:43,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235530347] [2022-07-13 22:33:43,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235530347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:43,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:33:43,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:33:43,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272258040] [2022-07-13 22:33:43,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:43,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:33:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:43,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:33:43,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:33:43,021 INFO L87 Difference]: Start difference. First operand 422 states and 603 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-13 22:33:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:43,600 INFO L93 Difference]: Finished difference Result 538 states and 762 transitions. [2022-07-13 22:33:43,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 22:33:43,600 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 148 [2022-07-13 22:33:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:43,602 INFO L225 Difference]: With dead ends: 538 [2022-07-13 22:33:43,602 INFO L226 Difference]: Without dead ends: 358 [2022-07-13 22:33:43,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:33:43,603 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 78 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:43,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 794 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:33:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-13 22:33:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 349. [2022-07-13 22:33:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 251 states have (on average 1.1274900398406376) internal successors, (283), 259 states have internal predecessors, (283), 69 states have call successors, (69), 23 states have call predecessors, (69), 28 states have return successors, (116), 66 states have call predecessors, (116), 68 states have call successors, (116) [2022-07-13 22:33:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 468 transitions. [2022-07-13 22:33:43,621 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 468 transitions. Word has length 148 [2022-07-13 22:33:43,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:43,621 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 468 transitions. [2022-07-13 22:33:43,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-13 22:33:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 468 transitions. [2022-07-13 22:33:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-13 22:33:43,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:43,623 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:33:43,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 22:33:43,623 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:43,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1614049972, now seen corresponding path program 1 times [2022-07-13 22:33:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:43,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542841409] [2022-07-13 22:33:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:33:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:33:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:33:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:33:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:33:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-13 22:33:43,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542841409] [2022-07-13 22:33:43,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542841409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762400558] [2022-07-13 22:33:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:43,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:43,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:43,883 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-13 22:33:43,884 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-13 22:33:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:44,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-13 22:33:44,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:44,496 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 10 treesize of output 8 [2022-07-13 22:33:44,564 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-13 22:33:44,757 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-13 22:33:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 22:33:44,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:33:44,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762400558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:33:44,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:33:44,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [12] total 25 [2022-07-13 22:33:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417846425] [2022-07-13 22:33:44,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:33:44,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:33:44,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:33:44,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:33:44,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:33:44,967 INFO L87 Difference]: Start difference. First operand 349 states and 468 transitions. Second operand has 15 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-13 22:33:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:33:45,429 INFO L93 Difference]: Finished difference Result 706 states and 1000 transitions. [2022-07-13 22:33:45,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:33:45,429 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 149 [2022-07-13 22:33:45,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:33:45,431 INFO L225 Difference]: With dead ends: 706 [2022-07-13 22:33:45,431 INFO L226 Difference]: Without dead ends: 470 [2022-07-13 22:33:45,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 160 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:33:45,433 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 70 mSDsluCounter, 3071 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 3406 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:33:45,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 3406 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 444 Invalid, 0 Unknown, 258 Unchecked, 0.4s Time] [2022-07-13 22:33:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-13 22:33:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2022-07-13 22:33:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 261 states have (on average 1.1226053639846743) internal successors, (293), 268 states have internal predecessors, (293), 69 states have call successors, (69), 24 states have call predecessors, (69), 28 states have return successors, (115), 66 states have call predecessors, (115), 68 states have call successors, (115) [2022-07-13 22:33:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 477 transitions. [2022-07-13 22:33:45,454 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 477 transitions. Word has length 149 [2022-07-13 22:33:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:33:45,454 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 477 transitions. [2022-07-13 22:33:45,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-13 22:33:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 477 transitions. [2022-07-13 22:33:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-13 22:33:45,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:33:45,456 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:33:45,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-13 22:33:45,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:45,671 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:33:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:33:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash -891040382, now seen corresponding path program 1 times [2022-07-13 22:33:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:33:45,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628480620] [2022-07-13 22:33:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:33:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:33:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:33:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:33:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:33:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:33:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:33:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:33:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:33:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:33:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:33:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:33:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:33:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:33:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:33:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:33:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-13 22:33:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:33:45,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628480620] [2022-07-13 22:33:45,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628480620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:33:45,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215876122] [2022-07-13 22:33:45,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:33:45,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:33:45,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:33:45,960 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-13 22:33:45,960 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-13 22:33:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:33:46,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 2892 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-13 22:33:46,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:33:46,585 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 10 treesize of output 8 [2022-07-13 22:33:46,988 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 45 treesize of output 43 [2022-07-13 22:33:46,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:46,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2022-07-13 22:33:47,067 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-13 22:33:47,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 44 treesize of output 53 [2022-07-13 22:33:47,076 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-13 22:33:47,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:47,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2022-07-13 22:33:48,956 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base_BEFORE_CALL_39| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base_BEFORE_CALL_39| |v_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base_BEFORE_CALL_25|)) (or (let ((.cse0 (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base_BEFORE_CALL_39|))) (and (not (= (mod (select .cse0 0) 18446744073709551616) 0)) (not (= (mod (select .cse0 16) 18446744073709551616) 0)))) (let ((.cse1 (* (- 1) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base_BEFORE_CALL_25|) 16)))) (< (div (+ 18446744073709551615 .cse1) (- 18446744073709551616)) (div .cse1 (- 18446744073709551616))))))) is different from true [2022-07-13 22:33:49,129 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-13 22:33:49,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 79 treesize of output 84 [2022-07-13 22:33:49,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:33:49,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2022-07-13 22:33:51,286 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_13| Int)) (and (or (let ((.cse0 (* (- 1) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_13|) 16)))) (< (div (+ 18446744073709551615 .cse0) (- 18446744073709551616)) (div .cse0 (- 18446744073709551616)))) (let ((.cse1 (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_3|))) (and (not (= (mod (select .cse1 0) 18446744073709551616) 0)) (not (= (mod (select .cse1 16) 18446744073709551616) 0))))) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_13|)))) is different from true [2022-07-13 22:33:53,431 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_14| Int)) (and (or (let ((.cse0 (* (- 1) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_14|) 16)))) (< (div (+ .cse0 18446744073709551615) (- 18446744073709551616)) (div .cse0 (- 18446744073709551616)))) (let ((.cse1 (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_4|))) (and (not (= (mod (select .cse1 16) 18446744073709551616) 0)) (not (= (mod (select .cse1 0) 18446744073709551616) 0))))) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_14|)))) is different from true [2022-07-13 22:33:55,339 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_15|)) (or (let ((.cse0 (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_5|))) (and (not (= (mod (select .cse0 0) 18446744073709551616) 0)) (not (= (mod (select .cse0 16) 18446744073709551616) 0)))) (let ((.cse1 (* (- 1) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_15|) 16)))) (< (div (+ 18446744073709551615 .cse1) (- 18446744073709551616)) (div .cse1 (- 18446744073709551616))))))) is different from true [2022-07-13 22:33:59,723 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5088 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_memset_impl_#in~s.base| v_ArrVal_5088))) is different from true [2022-07-13 22:33:59,733 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5088 (Array Int Int))) (= (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_5088) |c_#memory_int|)) is different from true [2022-07-13 22:33:59,750 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 22:33:59,750 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 36 treesize of output 38 [2022-07-13 22:34:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 45 proven. 39 refuted. 8 times theorem prover too weak. 12 trivial. 54 not checked. [2022-07-13 22:34:00,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:34:00,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5094 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_advance_~output#1.base| v_ArrVal_5094) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base|) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.offset|) 18446744073709551616) 0))) is different from false [2022-07-13 22:34:00,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215876122] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:34:00,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:34:00,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 34] total 43 [2022-07-13 22:34:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204531864] [2022-07-13 22:34:00,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:34:00,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-13 22:34:00,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:34:00,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-13 22:34:00,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1594, Unknown=9, NotChecked=602, Total=2352 [2022-07-13 22:34:00,429 INFO L87 Difference]: Start difference. First operand 359 states and 477 transitions. Second operand has 43 states, 41 states have (on average 3.7560975609756095) internal successors, (154), 38 states have internal predecessors, (154), 12 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2022-07-13 22:34:21,418 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5088 (Array Int Int))) (= (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_5088) |c_#memory_int|)) (not (= |c_my_memset_#in~n| 32))) is different from true [2022-07-13 22:34:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:34:24,109 INFO L93 Difference]: Finished difference Result 654 states and 920 transitions. [2022-07-13 22:34:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-13 22:34:24,110 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 3.7560975609756095) internal successors, (154), 38 states have internal predecessors, (154), 12 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) Word has length 150 [2022-07-13 22:34:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:34:24,112 INFO L225 Difference]: With dead ends: 654 [2022-07-13 22:34:24,113 INFO L226 Difference]: Without dead ends: 525 [2022-07-13 22:34:24,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 163 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=383, Invalid=3897, Unknown=42, NotChecked=1080, Total=5402 [2022-07-13 22:34:24,115 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 225 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 4821 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 9746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 4821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4785 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:34:24,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2427 Invalid, 9746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 4821 Invalid, 0 Unknown, 4785 Unchecked, 3.7s Time] [2022-07-13 22:34:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-07-13 22:34:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 415. [2022-07-13 22:34:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 304 states have (on average 1.118421052631579) internal successors, (340), 312 states have internal predecessors, (340), 76 states have call successors, (76), 30 states have call predecessors, (76), 34 states have return successors, (129), 72 states have call predecessors, (129), 75 states have call successors, (129) [2022-07-13 22:34:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 545 transitions. [2022-07-13 22:34:24,157 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 545 transitions. Word has length 150 [2022-07-13 22:34:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:34:24,157 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 545 transitions. [2022-07-13 22:34:24,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 3.7560975609756095) internal successors, (154), 38 states have internal predecessors, (154), 12 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2022-07-13 22:34:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 545 transitions. [2022-07-13 22:34:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-13 22:34:24,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:34:24,159 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-13 22:34:24,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-13 22:34:24,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:34:24,375 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:34:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:34:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash -985042663, now seen corresponding path program 1 times [2022-07-13 22:34:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:34:24,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878442543] [2022-07-13 22:34:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:34:24,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:34:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:34:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:34:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:34:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:34:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:34:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:34:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:34:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:34:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:34:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:34:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:34:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:34:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:34:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 22:34:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:34:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:34:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-13 22:34:24,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:34:24,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878442543] [2022-07-13 22:34:24,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878442543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:34:24,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:34:24,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:34:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607834853] [2022-07-13 22:34:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:34:24,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:34:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:34:24,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:34:24,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:34:24,620 INFO L87 Difference]: Start difference. First operand 415 states and 545 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 22:34:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:34:25,255 INFO L93 Difference]: Finished difference Result 427 states and 557 transitions. [2022-07-13 22:34:25,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:34:25,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2022-07-13 22:34:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:34:25,257 INFO L225 Difference]: With dead ends: 427 [2022-07-13 22:34:25,257 INFO L226 Difference]: Without dead ends: 425 [2022-07-13 22:34:25,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:34:25,258 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 78 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:34:25,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 989 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:34:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-07-13 22:34:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 420. [2022-07-13 22:34:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 307 states have (on average 1.1172638436482085) internal successors, (343), 315 states have internal predecessors, (343), 77 states have call successors, (77), 31 states have call predecessors, (77), 35 states have return successors, (130), 73 states have call predecessors, (130), 76 states have call successors, (130) [2022-07-13 22:34:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 550 transitions. [2022-07-13 22:34:25,284 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 550 transitions. Word has length 152 [2022-07-13 22:34:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:34:25,284 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 550 transitions. [2022-07-13 22:34:25,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 22:34:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 550 transitions. [2022-07-13 22:34:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-13 22:34:25,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:34:25,286 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:34:25,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 22:34:25,286 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:34:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:34:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash -72937408, now seen corresponding path program 2 times [2022-07-13 22:34:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:34:25,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731344001] [2022-07-13 22:34:25,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:34:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:34:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:34:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:34:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:34:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:34:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:34:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:34:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:34:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:34:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:34:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:34:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:34:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:34:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:34:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 22:34:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-13 22:34:25,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:34:25,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731344001] [2022-07-13 22:34:25,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731344001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:34:25,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070525446] [2022-07-13 22:34:25,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:34:25,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:34:25,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:34:25,668 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-13 22:34:25,669 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-13 22:34:26,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:34:26,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:34:26,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 2911 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-13 22:34:26,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:34:26,691 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 10 treesize of output 8 [2022-07-13 22:34:26,756 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-13 22:34:27,188 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-13 22:34:27,193 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-13 22:34:27,212 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:34:27,213 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 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-13 22:34:27,215 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 6 [2022-07-13 22:34:27,227 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:34:27,228 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-13 22:34:27,231 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 3 [2022-07-13 22:34:27,296 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:34:27,297 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 1 case distinctions, treesize of input 21 treesize of output 27 [2022-07-13 22:34:27,308 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:34:27,308 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 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-13 22:34:27,988 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5511 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_memset_impl_#in~s.base| v_ArrVal_5511))) (exists ((v_ArrVal_5513 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_memset_impl_#in~s.base| v_ArrVal_5513))) (exists ((v_ArrVal_5512 (Array Int Int))) (= (store |c_old(#memory_int)| |c_memset_impl_#in~s.base| v_ArrVal_5512) |c_#memory_int|))) is different from true [2022-07-13 22:34:28,007 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5513 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_my_memset_#in~s.base| v_ArrVal_5513) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5512 (Array Int Int))) (= (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_5512) |c_#memory_int|)) (exists ((v_ArrVal_5511 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_my_memset_#in~s.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 22:34:28,018 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 6 treesize of output 5 [2022-07-13 22:34:28,021 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-13 22:34:28,023 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-13 22:34:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 59 proven. 70 refuted. 0 times theorem prover too weak. 29 trivial. 3 not checked. [2022-07-13 22:34:28,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:34:29,135 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_5532 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_advance_~output#1.base| v_ArrVal_5532) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.offset|)) 0)) (forall ((v_ArrVal_5534 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_advance_~output#1.base| v_ArrVal_5534) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.offset|)) 0))) (forall ((v_ArrVal_5533 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_advance_~output#1.base| v_ArrVal_5533) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base|) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.offset|) 18446744073709551616) 0)))) is different from false [2022-07-13 22:34:29,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070525446] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:34:29,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:34:29,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 36] total 47 [2022-07-13 22:34:29,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983912416] [2022-07-13 22:34:29,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:34:29,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-13 22:34:29,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:34:29,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-13 22:34:29,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2476, Unknown=4, NotChecked=306, Total=2970 [2022-07-13 22:34:29,138 INFO L87 Difference]: Start difference. First operand 420 states and 550 transitions. Second operand has 47 states, 43 states have (on average 3.6744186046511627) internal successors, (158), 40 states have internal predecessors, (158), 14 states have call successors, (36), 9 states have call predecessors, (36), 12 states have return successors, (35), 14 states have call predecessors, (35), 14 states have call successors, (35) [2022-07-13 22:34:32,006 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5513 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_my_memset_#in~s.base| v_ArrVal_5513) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5512 (Array Int Int))) (= (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_5512) |c_#memory_int|)) (exists ((v_ArrVal_5511 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_my_memset_#in~s.base| v_ArrVal_5511) |c_#memory_$Pointer$.base|)) (not (= |c_my_memset_#in~n| 32))) is different from true [2022-07-13 22:34:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:34:35,465 INFO L93 Difference]: Finished difference Result 891 states and 1256 transitions. [2022-07-13 22:34:35,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-13 22:34:35,465 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 3.6744186046511627) internal successors, (158), 40 states have internal predecessors, (158), 14 states have call successors, (36), 9 states have call predecessors, (36), 12 states have return successors, (35), 14 states have call predecessors, (35), 14 states have call successors, (35) Word has length 152 [2022-07-13 22:34:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:34:35,468 INFO L225 Difference]: With dead ends: 891 [2022-07-13 22:34:35,468 INFO L226 Difference]: Without dead ends: 730 [2022-07-13 22:34:35,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 166 SyntacticMatches, 11 SemanticMatches, 99 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2666 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=753, Invalid=8564, Unknown=11, NotChecked=772, Total=10100 [2022-07-13 22:34:35,471 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 467 mSDsluCounter, 4059 mSDsCounter, 0 mSdLazyCounter, 6455 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 4400 SdHoareTripleChecker+Invalid, 10646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 6455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3556 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:34:35,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 4400 Invalid, 10646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 6455 Invalid, 0 Unknown, 3556 Unchecked, 4.5s Time] [2022-07-13 22:34:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-07-13 22:34:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 504. [2022-07-13 22:34:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 374 states have (on average 1.106951871657754) internal successors, (414), 384 states have internal predecessors, (414), 86 states have call successors, (86), 37 states have call predecessors, (86), 43 states have return successors, (146), 82 states have call predecessors, (146), 85 states have call successors, (146) [2022-07-13 22:34:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 646 transitions. [2022-07-13 22:34:35,503 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 646 transitions. Word has length 152 [2022-07-13 22:34:35,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:34:35,503 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 646 transitions. [2022-07-13 22:34:35,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 3.6744186046511627) internal successors, (158), 40 states have internal predecessors, (158), 14 states have call successors, (36), 9 states have call predecessors, (36), 12 states have return successors, (35), 14 states have call predecessors, (35), 14 states have call successors, (35) [2022-07-13 22:34:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 646 transitions. [2022-07-13 22:34:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-13 22:34:35,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:34:35,505 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:34:35,542 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-13 22:34:35,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:34:35,742 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:34:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:34:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash 145005438, now seen corresponding path program 3 times [2022-07-13 22:34:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:34:35,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579546165] [2022-07-13 22:34:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:34:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:34:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:34:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:34:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:34:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:34:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:34:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:34:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:34:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:34:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:34:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:34:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:34:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:34:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:34:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:35,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:36,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:34:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-13 22:34:36,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:34:36,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579546165] [2022-07-13 22:34:36,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579546165] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:34:36,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630241338] [2022-07-13 22:34:36,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 22:34:36,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:34:36,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:34:36,082 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-13 22:34:36,083 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-13 22:34:38,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 22:34:38,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:34:38,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 22:34:38,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:34:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 37 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-13 22:34:38,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:34:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-13 22:34:38,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630241338] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:34:38,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:34:38,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 26 [2022-07-13 22:34:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113971533] [2022-07-13 22:34:38,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:34:38,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 22:34:38,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:34:38,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 22:34:38,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:34:38,498 INFO L87 Difference]: Start difference. First operand 504 states and 646 transitions. Second operand has 26 states, 24 states have (on average 4.5) internal successors, (108), 23 states have internal predecessors, (108), 6 states have call successors, (26), 5 states have call predecessors, (26), 6 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-13 22:34:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:34:39,693 INFO L93 Difference]: Finished difference Result 628 states and 814 transitions. [2022-07-13 22:34:39,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:34:39,694 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.5) internal successors, (108), 23 states have internal predecessors, (108), 6 states have call successors, (26), 5 states have call predecessors, (26), 6 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 154 [2022-07-13 22:34:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:34:39,696 INFO L225 Difference]: With dead ends: 628 [2022-07-13 22:34:39,696 INFO L226 Difference]: Without dead ends: 507 [2022-07-13 22:34:39,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 22:34:39,697 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 200 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:34:39,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1579 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 22:34:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-07-13 22:34:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 506. [2022-07-13 22:34:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 376 states have (on average 1.1063829787234043) internal successors, (416), 386 states have internal predecessors, (416), 86 states have call successors, (86), 37 states have call predecessors, (86), 43 states have return successors, (146), 82 states have call predecessors, (146), 85 states have call successors, (146) [2022-07-13 22:34:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 648 transitions. [2022-07-13 22:34:39,727 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 648 transitions. Word has length 154 [2022-07-13 22:34:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:34:39,727 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 648 transitions. [2022-07-13 22:34:39,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.5) internal successors, (108), 23 states have internal predecessors, (108), 6 states have call successors, (26), 5 states have call predecessors, (26), 6 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-13 22:34:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 648 transitions. [2022-07-13 22:34:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-13 22:34:39,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:34:39,729 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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-13 22:34:39,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-13 22:34:39,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:34:39,941 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:34:39,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:34:39,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1445698209, now seen corresponding path program 1 times [2022-07-13 22:34:39,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:34:39,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838816097] [2022-07-13 22:34:39,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:34:39,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:34:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:34:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:34:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:34:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:34:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:34:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:34:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:34:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:34:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:34:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:34:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:34:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:34:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:34:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:34:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 22:34:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:34:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:34:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-07-13 22:34:40,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:34:40,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838816097] [2022-07-13 22:34:40,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838816097] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:34:40,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66574062] [2022-07-13 22:34:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:34:40,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:34:40,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:34:40,613 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:34:40,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 22:34:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:34:41,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 3040 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-13 22:34:41,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:34:41,263 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 10 treesize of output 8 [2022-07-13 22:34:41,361 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-13 22:34:41,363 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-13 22:34:47,862 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 37 treesize of output 25 [2022-07-13 22:34:47,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:34:47,867 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 22 treesize of output 23 [2022-07-13 22:34:47,878 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-13 22:34:47,942 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:34:47,942 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 1 case distinctions, treesize of input 32 treesize of output 36 [2022-07-13 22:34:47,946 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 21 treesize of output 13 [2022-07-13 22:34:47,964 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:34:47,964 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 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-13 22:34:47,967 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-13 22:34:50,224 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:34:50,224 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 1 case distinctions, treesize of input 21 treesize of output 27 [2022-07-13 22:34:50,235 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:34:50,236 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 1 case distinctions, treesize of input 36 treesize of output 40 [2022-07-13 22:34:52,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:34:52,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-13 22:34:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 143 proven. 39 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 22:34:57,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:34:57,942 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_6136 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_6136) |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.offset| 16)) 18446744073709551616) 0))) (forall ((v_ArrVal_6135 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_6135) |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.offset| 8)) 0)))) is different from false [2022-07-13 22:34:57,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66574062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:34:57,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:34:57,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 29] total 45 [2022-07-13 22:34:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627452628] [2022-07-13 22:34:57,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:34:57,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-13 22:34:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:34:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-13 22:34:57,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2753, Unknown=5, NotChecked=106, Total=3080 [2022-07-13 22:34:57,949 INFO L87 Difference]: Start difference. First operand 506 states and 648 transitions. Second operand has 45 states, 41 states have (on average 3.7804878048780486) internal successors, (155), 39 states have internal predecessors, (155), 15 states have call successors, (37), 8 states have call predecessors, (37), 13 states have return successors, (36), 14 states have call predecessors, (36), 15 states have call successors, (36) [2022-07-13 22:35:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:35:51,279 INFO L93 Difference]: Finished difference Result 883 states and 1175 transitions. [2022-07-13 22:35:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-13 22:35:51,280 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 3.7804878048780486) internal successors, (155), 39 states have internal predecessors, (155), 15 states have call successors, (37), 8 states have call predecessors, (37), 13 states have return successors, (36), 14 states have call predecessors, (36), 15 states have call successors, (36) Word has length 156 [2022-07-13 22:35:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:35:51,282 INFO L225 Difference]: With dead ends: 883 [2022-07-13 22:35:51,282 INFO L226 Difference]: Without dead ends: 639 [2022-07-13 22:35:51,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 244 SyntacticMatches, 8 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2578 ImplicationChecksByTransitivity, 66.3s TimeCoverageRelationStatistics Valid=708, Invalid=8014, Unknown=24, NotChecked=184, Total=8930 [2022-07-13 22:35:51,284 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 313 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 4110 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 6778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 4110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2373 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:35:51,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 2432 Invalid, 6778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 4110 Invalid, 0 Unknown, 2373 Unchecked, 3.0s Time] [2022-07-13 22:35:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-07-13 22:35:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 516. [2022-07-13 22:35:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 386 states have (on average 1.1139896373056994) internal successors, (430), 397 states have internal predecessors, (430), 85 states have call successors, (85), 38 states have call predecessors, (85), 44 states have return successors, (146), 80 states have call predecessors, (146), 84 states have call successors, (146) [2022-07-13 22:35:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 661 transitions. [2022-07-13 22:35:51,316 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 661 transitions. Word has length 156 [2022-07-13 22:35:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:35:51,317 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 661 transitions. [2022-07-13 22:35:51,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 3.7804878048780486) internal successors, (155), 39 states have internal predecessors, (155), 15 states have call successors, (37), 8 states have call predecessors, (37), 13 states have return successors, (36), 14 states have call predecessors, (36), 15 states have call successors, (36) [2022-07-13 22:35:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 661 transitions. [2022-07-13 22:35:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-13 22:35:51,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:35:51,318 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:35:51,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-13 22:35:51,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:35:51,531 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:35:51,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:35:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash 388686379, now seen corresponding path program 1 times [2022-07-13 22:35:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:35:51,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823988473] [2022-07-13 22:35:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:35:51,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:35:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:35:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:35:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:35:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:35:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:35:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:35:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:35:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:35:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:35:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:35:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:35:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:35:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:35:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:35:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:35:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:35:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:35:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 50 proven. 26 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-07-13 22:35:52,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:35:52,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823988473] [2022-07-13 22:35:52,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823988473] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:35:52,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069142102] [2022-07-13 22:35:52,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:35:52,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:35:52,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:35:52,345 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:35:52,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-13 22:35:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:53,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 3004 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-13 22:35:53,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:35:53,053 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 10 treesize of output 8 [2022-07-13 22:35:53,178 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-13 22:35:53,785 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-13 22:35:53,787 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-13 22:35:53,834 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-13 22:35:53,834 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 29 treesize of output 11 [2022-07-13 22:35:53,838 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 18 treesize of output 10 [2022-07-13 22:35:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-13 22:35:53,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:35:53,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069142102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:35:53,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:35:53,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [22] total 37 [2022-07-13 22:35:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550450441] [2022-07-13 22:35:53,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:35:53,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 22:35:53,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:35:53,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 22:35:53,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 22:35:53,871 INFO L87 Difference]: Start difference. First operand 516 states and 661 transitions. Second operand has 17 states, 16 states have (on average 5.0625) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-13 22:35:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:35:54,958 INFO L93 Difference]: Finished difference Result 857 states and 1145 transitions. [2022-07-13 22:35:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 22:35:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-07-13 22:35:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:35:54,960 INFO L225 Difference]: With dead ends: 857 [2022-07-13 22:35:54,960 INFO L226 Difference]: Without dead ends: 590 [2022-07-13 22:35:54,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=1419, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 22:35:54,962 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 393 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1275 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:35:54,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1039 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1242 Invalid, 0 Unknown, 1275 Unchecked, 1.0s Time] [2022-07-13 22:35:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-07-13 22:35:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 503. [2022-07-13 22:35:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 375 states have (on average 1.1066666666666667) internal successors, (415), 385 states have internal predecessors, (415), 84 states have call successors, (84), 37 states have call predecessors, (84), 43 states have return successors, (141), 80 states have call predecessors, (141), 83 states have call successors, (141) [2022-07-13 22:35:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 640 transitions. [2022-07-13 22:35:54,998 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 640 transitions. Word has length 155 [2022-07-13 22:35:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:35:54,999 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 640 transitions. [2022-07-13 22:35:54,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 13 states have internal predecessors, (81), 6 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-13 22:35:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 640 transitions. [2022-07-13 22:35:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-13 22:35:55,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:35:55,000 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:35:55,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-13 22:35:55,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-13 22:35:55,216 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:35:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:35:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1890280047, now seen corresponding path program 1 times [2022-07-13 22:35:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:35:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238241498] [2022-07-13 22:35:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:35:55,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:35:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:35:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:35:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:35:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:35:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:35:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:35:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:35:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:35:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:35:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:35:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:35:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:35:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:35:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:35:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 22:35:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 22:35:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 22:35:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-13 22:35:55,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:35:55,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238241498] [2022-07-13 22:35:55,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238241498] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:35:55,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918630977] [2022-07-13 22:35:55,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:35:55,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:35:55,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:35:55,605 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:35:55,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-13 22:35:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:35:56,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 3006 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-13 22:35:56,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:35:56,302 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 10 treesize of output 8 [2022-07-13 22:35:56,353 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 22 treesize of output 25 [2022-07-13 22:35:56,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:35:56,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2022-07-13 22:35:57,234 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_19| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_29| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_19|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_29|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_19|) 16)))) is different from true [2022-07-13 22:36:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 156 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 1 not checked. [2022-07-13 22:36:02,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:36:05,083 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 60 treesize of output 42 [2022-07-13 22:36:05,086 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 98 treesize of output 94 [2022-07-13 22:36:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-13 22:36:05,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918630977] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:36:05,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:36:05,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 33 [2022-07-13 22:36:05,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232300284] [2022-07-13 22:36:05,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:36:05,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 22:36:05,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:36:05,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 22:36:05,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=898, Unknown=2, NotChecked=60, Total=1056 [2022-07-13 22:36:05,178 INFO L87 Difference]: Start difference. First operand 503 states and 640 transitions. Second operand has 33 states, 30 states have (on average 5.566666666666666) internal successors, (167), 29 states have internal predecessors, (167), 9 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (40), 7 states have call predecessors, (40), 9 states have call successors, (40) [2022-07-13 22:36:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:36:44,125 INFO L93 Difference]: Finished difference Result 923 states and 1252 transitions. [2022-07-13 22:36:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-13 22:36:44,126 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.566666666666666) internal successors, (167), 29 states have internal predecessors, (167), 9 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (40), 7 states have call predecessors, (40), 9 states have call successors, (40) Word has length 159 [2022-07-13 22:36:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:36:44,129 INFO L225 Difference]: With dead ends: 923 [2022-07-13 22:36:44,129 INFO L226 Difference]: Without dead ends: 589 [2022-07-13 22:36:44,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 332 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=389, Invalid=4276, Unknown=31, NotChecked=134, Total=4830 [2022-07-13 22:36:44,130 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 309 mSDsluCounter, 2241 mSDsCounter, 0 mSdLazyCounter, 4065 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 5765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 4065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1394 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:36:44,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2500 Invalid, 5765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 4065 Invalid, 0 Unknown, 1394 Unchecked, 2.8s Time] [2022-07-13 22:36:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-07-13 22:36:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 479. [2022-07-13 22:36:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 353 states have (on average 1.084985835694051) internal successors, (383), 361 states have internal predecessors, (383), 84 states have call successors, (84), 37 states have call predecessors, (84), 41 states have return successors, (133), 80 states have call predecessors, (133), 83 states have call successors, (133) [2022-07-13 22:36:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 600 transitions. [2022-07-13 22:36:44,164 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 600 transitions. Word has length 159 [2022-07-13 22:36:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:36:44,164 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 600 transitions. [2022-07-13 22:36:44,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.566666666666666) internal successors, (167), 29 states have internal predecessors, (167), 9 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (40), 7 states have call predecessors, (40), 9 states have call successors, (40) [2022-07-13 22:36:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2022-07-13 22:36:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 22:36:44,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:36:44,166 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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-13 22:36:44,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-13 22:36:44,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-13 22:36:44,390 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:36:44,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:36:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1595947110, now seen corresponding path program 2 times [2022-07-13 22:36:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:36:44,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916432973] [2022-07-13 22:36:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:36:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:36:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:36:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:36:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:36:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:36:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:36:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:36:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:36:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:36:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:36:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:36:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:36:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:36:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:36:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:36:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:36:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:36:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:36:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:36:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 53 proven. 62 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-13 22:36:46,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:36:46,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916432973] [2022-07-13 22:36:46,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916432973] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:36:46,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460892560] [2022-07-13 22:36:46,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:36:46,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:36:46,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:36:46,633 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:36:46,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-13 22:36:47,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:36:47,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:36:47,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 3008 conjuncts, 129 conjunts are in the unsatisfiable core [2022-07-13 22:36:47,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:36:47,799 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 10 treesize of output 8 [2022-07-13 22:36:47,892 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-13 22:36:47,914 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 22 treesize of output 25 [2022-07-13 22:36:47,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:36:47,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2022-07-13 22:36:48,813 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_35| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_35| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_21|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_21|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_35|) 16)))) is different from true [2022-07-13 22:36:49,752 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_22| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_36| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_22|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_36|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_22|) 16)))) is different from true [2022-07-13 22:36:50,623 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_23| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_23|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_37|) 16)) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_37| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_23|)))) is different from true [2022-07-13 22:37:06,642 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_38| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_24| Int)) (let ((.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_38|) 16))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_38| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_24|)) (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_24|) 16)) (not (= (mod .cse0 18446744073709551616) 0))))) is different from true [2022-07-13 22:37:07,978 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_25| Int)) (let ((.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_39|) 16))) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_39| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_25|)) (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_25|) 16)) (not (= (mod .cse0 18446744073709551616) 0))))) is different from true [2022-07-13 22:37:08,117 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-13 22:37:08,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 41 [2022-07-13 22:37:08,126 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-13 22:37:08,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:37:08,143 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-13 22:37:09,436 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_26| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_40| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_26|)) (or (not (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_40|) 16) 18446744073709551616) 0)) (let ((.cse0 (* (- 1) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_26|) 16)))) (< (div (+ 18446744073709551615 .cse0) (- 18446744073709551616)) (div .cse0 (- 18446744073709551616))))))) is different from true