./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:03:16,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:03:16,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:03:16,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:03:16,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:03:16,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:03:16,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:03:16,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:03:16,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:03:16,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:03:16,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:03:16,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:03:16,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:03:16,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:03:16,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:03:16,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:03:16,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:03:16,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:03:16,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:03:16,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:03:16,854 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:03:16,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:03:16,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:03:16,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:03:16,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:03:16,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:03:16,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:03:16,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:03:16,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:03:16,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:03:16,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:03:16,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:03:16,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:03:16,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:03:16,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:03:16,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:03:16,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:03:16,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:03:16,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:03:16,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:03:16,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:03:16,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:03:16,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:03:16,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:03:16,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:03:16,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:03:16,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:03:16,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:03:16,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:03:16,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:03:16,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:03:16,910 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:03:16,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:03:16,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:03:16,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:03:16,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:03:16,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:03:16,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:03:16,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:03:16,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:03:16,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:03:16,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:03:16,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:03:16,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:03:16,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:03:16,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:03:16,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:03:16,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:03:16,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:03:16,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:03:16,915 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:03:16,915 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:03:16,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:03:16,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 [2022-07-19 22:03:17,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:03:17,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:03:17,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:03:17,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:03:17,159 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:03:17,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i [2022-07-19 22:03:17,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191f50879/008828b99cb9417aa7314177b6d79a98/FLAG071a3c64c [2022-07-19 22:03:17,875 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:03:17,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i [2022-07-19 22:03:17,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191f50879/008828b99cb9417aa7314177b6d79a98/FLAG071a3c64c [2022-07-19 22:03:17,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191f50879/008828b99cb9417aa7314177b6d79a98 [2022-07-19 22:03:17,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:03:17,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:03:17,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:03:17,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:03:17,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:03:17,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:03:17" (1/1) ... [2022-07-19 22:03:17,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b40cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:17, skipping insertion in model container [2022-07-19 22:03:17,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:03:17" (1/1) ... [2022-07-19 22:03:17,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:03:18,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:03:18,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i[4497,4510] [2022-07-19 22:03:18,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i[4557,4570] [2022-07-19 22:03:18,966 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:18,969 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:18,970 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:18,971 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:18,972 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:18,980 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:18,982 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:18,985 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:18,985 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,230 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:03:19,231 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:03:19,232 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:03:19,233 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:03:19,234 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:03:19,235 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:03:19,235 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:03:19,236 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:03:19,236 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:03:19,237 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:03:19,371 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:03:19,436 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,437 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:03:19,562 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:03:19,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i[4497,4510] [2022-07-19 22:03:19,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i[4557,4570] [2022-07-19 22:03:19,631 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,639 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,640 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,640 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,641 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,646 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,646 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,647 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,647 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,705 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:03:19,716 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:03:19,717 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:03:19,717 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:03:19,718 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:03:19,719 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:03:19,719 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:03:19,720 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:03:19,723 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:03:19,724 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:03:19,749 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:03:19,824 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,825 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:03:19,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:03:20,096 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:03:20,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20 WrapperNode [2022-07-19 22:03:20,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:03:20,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:03:20,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:03:20,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:03:20,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (1/1) ... [2022-07-19 22:03:20,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (1/1) ... [2022-07-19 22:03:20,283 INFO L137 Inliner]: procedures = 690, calls = 2642, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 882 [2022-07-19 22:03:20,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:03:20,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:03:20,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:03:20,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:03:20,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (1/1) ... [2022-07-19 22:03:20,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (1/1) ... [2022-07-19 22:03:20,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (1/1) ... [2022-07-19 22:03:20,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (1/1) ... [2022-07-19 22:03:20,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (1/1) ... [2022-07-19 22:03:20,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (1/1) ... [2022-07-19 22:03:20,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (1/1) ... [2022-07-19 22:03:20,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:03:20,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:03:20,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:03:20,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:03:20,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (1/1) ... [2022-07-19 22:03:20,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:03:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:20,424 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-19 22:03:20,455 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-19 22:03:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-19 22:03:20,466 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-19 22:03:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:03:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 22:03:20,467 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 22:03:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:03:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:03:20,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:03:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:03:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:03:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:03:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:03:20,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:03:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:03:20,471 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:03:20,471 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-19 22:03:20,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-19 22:03:20,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:03:20,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:03:20,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:03:20,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:03:20,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:03:20,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:03:20,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:03:20,762 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:03:20,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:03:21,703 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:03:21,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:03:21,713 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 22:03:21,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:03:21 BoogieIcfgContainer [2022-07-19 22:03:21,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:03:21,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:03:21,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:03:21,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:03:21,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:03:17" (1/3) ... [2022-07-19 22:03:21,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442e2af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:03:21, skipping insertion in model container [2022-07-19 22:03:21,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:03:20" (2/3) ... [2022-07-19 22:03:21,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442e2af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:03:21, skipping insertion in model container [2022-07-19 22:03:21,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:03:21" (3/3) ... [2022-07-19 22:03:21,733 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_advance_harness.i [2022-07-19 22:03:21,745 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:03:21,746 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:03:21,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:03:21,819 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@2bd3738e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40a6576 [2022-07-19 22:03:21,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:03:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-19 22:03:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 22:03:21,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:21,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:21,833 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:21,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1865164224, now seen corresponding path program 1 times [2022-07-19 22:03:21,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:21,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891738946] [2022-07-19 22:03:21,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:21,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 22:03:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:03:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:03:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:03:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 22:03:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:22,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891738946] [2022-07-19 22:03:22,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891738946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:22,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:03:22,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 22:03:22,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194526182] [2022-07-19 22:03:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:22,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 22:03:22,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:22,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 22:03:22,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 22:03:22,461 INFO L87 Difference]: Start difference. First operand has 90 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:03:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:22,507 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2022-07-19 22:03:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 22:03:22,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-07-19 22:03:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:22,519 INFO L225 Difference]: With dead ends: 170 [2022-07-19 22:03:22,519 INFO L226 Difference]: Without dead ends: 80 [2022-07-19 22:03:22,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 22:03:22,538 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:22,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:03:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-19 22:03:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-19 22:03:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-19 22:03:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2022-07-19 22:03:22,590 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 47 [2022-07-19 22:03:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:22,593 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2022-07-19 22:03:22,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:03:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-07-19 22:03:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 22:03:22,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:22,597 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:22,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:03:22,597 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:22,598 INFO L85 PathProgramCache]: Analyzing trace with hash 866728124, now seen corresponding path program 1 times [2022-07-19 22:03:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:22,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713082171] [2022-07-19 22:03:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 22:03:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:03:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:03:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:03:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 22:03:22,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:22,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713082171] [2022-07-19 22:03:22,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713082171] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:22,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360799392] [2022-07-19 22:03:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:22,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:22,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:22,915 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-19 22:03:22,946 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-19 22:03:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:23,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 2490 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 22:03:23,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 22:03:23,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:03:23,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360799392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:23,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:03:23,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-07-19 22:03:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670359057] [2022-07-19 22:03:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:23,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:03:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:23,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:03:23,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:03:23,549 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:03:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:23,745 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2022-07-19 22:03:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:03:23,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-07-19 22:03:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:23,749 INFO L225 Difference]: With dead ends: 146 [2022-07-19 22:03:23,749 INFO L226 Difference]: Without dead ends: 83 [2022-07-19 22:03:23,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:03:23,755 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 128 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:23,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 258 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:03:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-19 22:03:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-19 22:03:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-07-19 22:03:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2022-07-19 22:03:23,776 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 47 [2022-07-19 22:03:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:23,777 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2022-07-19 22:03:23,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:03:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2022-07-19 22:03:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 22:03:23,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:23,784 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:23,815 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-19 22:03:24,007 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-19 22:03:24,008 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:24,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash -912055711, now seen corresponding path program 1 times [2022-07-19 22:03:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:24,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13138189] [2022-07-19 22:03:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:24,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:24,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:24,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:03:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:24,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:03:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:24,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 22:03:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:24,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 22:03:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 22:03:24,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:24,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13138189] [2022-07-19 22:03:24,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13138189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:24,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290527445] [2022-07-19 22:03:24,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:24,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:24,241 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-19 22:03:24,272 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-19 22:03:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:24,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 2495 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 22:03:24,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:03:24,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:03:24,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290527445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:24,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:03:24,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-07-19 22:03:24,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785623933] [2022-07-19 22:03:24,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:24,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:03:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:24,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:03:24,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:03:24,772 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 22:03:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:24,943 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2022-07-19 22:03:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:03:24,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2022-07-19 22:03:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:24,945 INFO L225 Difference]: With dead ends: 141 [2022-07-19 22:03:24,945 INFO L226 Difference]: Without dead ends: 83 [2022-07-19 22:03:24,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:03:24,946 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 145 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:24,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 251 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:03:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-19 22:03:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-19 22:03:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-07-19 22:03:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2022-07-19 22:03:24,955 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 49 [2022-07-19 22:03:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:24,955 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2022-07-19 22:03:24,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 22:03:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2022-07-19 22:03:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 22:03:24,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:24,957 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:24,990 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-19 22:03:25,170 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-19 22:03:25,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:25,171 INFO L85 PathProgramCache]: Analyzing trace with hash -633300053, now seen corresponding path program 1 times [2022-07-19 22:03:25,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:25,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492665757] [2022-07-19 22:03:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:25,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:25,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:25,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:03:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:03:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:25,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:03:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:03:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 22:03:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:25,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492665757] [2022-07-19 22:03:25,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492665757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:25,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:03:25,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:03:25,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369400059] [2022-07-19 22:03:25,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:25,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:03:25,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:25,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:03:25,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:03:25,466 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 22:03:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:25,555 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-07-19 22:03:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:03:25,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2022-07-19 22:03:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:25,559 INFO L225 Difference]: With dead ends: 95 [2022-07-19 22:03:25,559 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 22:03:25,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:03:25,563 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 16 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:25,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 691 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:03:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 22:03:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-07-19 22:03:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 60 states have (on average 1.2) internal successors, (72), 64 states have internal predecessors, (72), 23 states have call successors, (23), 7 states have call predecessors, (23), 8 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2022-07-19 22:03:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2022-07-19 22:03:25,586 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 53 [2022-07-19 22:03:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:25,586 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2022-07-19 22:03:25,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 22:03:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2022-07-19 22:03:25,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 22:03:25,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:25,588 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:25,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:03:25,589 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:25,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1847539699, now seen corresponding path program 1 times [2022-07-19 22:03:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:25,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948980573] [2022-07-19 22:03:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:26,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:26,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:26,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:03:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:26,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:03:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:26,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:03:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:26,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:03:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 22:03:26,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:26,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948980573] [2022-07-19 22:03:26,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948980573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278581855] [2022-07-19 22:03:26,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:26,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:26,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:26,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:03:26,297 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-19 22:03:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:26,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 2517 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-19 22:03:26,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:26,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:03:27,343 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 22:03:27,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 22:03:27,449 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-19 22:03:27,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-19 22:03:27,898 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 22:03:27,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 22:03:27,946 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-19 22:03:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 22:03:28,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:03:28,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_270) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (<= .cse0 (* 18446744073709551616 (div .cse0 18446744073709551616))))) is different from false [2022-07-19 22:03:28,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278581855] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:28,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:03:28,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2022-07-19 22:03:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331693777] [2022-07-19 22:03:28,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:03:28,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 22:03:28,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:28,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 22:03:28,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1107, Unknown=1, NotChecked=68, Total=1332 [2022-07-19 22:03:28,527 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-19 22:03:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:29,892 INFO L93 Difference]: Finished difference Result 261 states and 360 transitions. [2022-07-19 22:03:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-19 22:03:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) Word has length 57 [2022-07-19 22:03:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:29,899 INFO L225 Difference]: With dead ends: 261 [2022-07-19 22:03:29,899 INFO L226 Difference]: Without dead ends: 196 [2022-07-19 22:03:29,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=299, Invalid=2154, Unknown=1, NotChecked=96, Total=2550 [2022-07-19 22:03:29,901 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 127 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 465 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:29,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1140 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 826 Invalid, 0 Unknown, 465 Unchecked, 0.8s Time] [2022-07-19 22:03:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-19 22:03:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 156. [2022-07-19 22:03:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 111 states have internal predecessors, (132), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (42), 31 states have call predecessors, (42), 31 states have call successors, (42) [2022-07-19 22:03:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 208 transitions. [2022-07-19 22:03:29,920 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 208 transitions. Word has length 57 [2022-07-19 22:03:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:29,920 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 208 transitions. [2022-07-19 22:03:29,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-19 22:03:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 208 transitions. [2022-07-19 22:03:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 22:03:29,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:29,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:29,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 22:03:30,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:30,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash 259191797, now seen corresponding path program 1 times [2022-07-19 22:03:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:30,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291560866] [2022-07-19 22:03:30,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:30,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:03:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:30,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:03:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:03:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:30,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:03:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 22:03:30,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:30,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291560866] [2022-07-19 22:03:30,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291560866] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:30,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030859455] [2022-07-19 22:03:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:30,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:30,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:30,871 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-19 22:03:30,896 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-19 22:03:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:36,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 2547 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-19 22:03:36,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:36,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:03:36,945 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 22:03:36,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 22:03:37,064 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-19 22:03:37,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-19 22:03:37,469 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 22:03:37,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 22:03:37,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-07-19 22:03:37,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:03:37,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 22:03:37,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:03:37,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2022-07-19 22:03:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 22:03:38,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:03:38,644 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:03:38,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-19 22:03:38,654 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| Int)) (or (not (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|) |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1|)) (<= |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1| (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (+ (* (div (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1| (* (- 1) .cse0)) 18446744073709551616) 18446744073709551616) .cse0))))) |c_ULTIMATE.start_aws_byte_cursor_advance_#t~short1082#1|) is different from false [2022-07-19 22:03:38,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|))) (or (< (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|) 18446744073709551616) (mod .cse0 18446744073709551616)) (<= .cse0 (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (+ (* 18446744073709551616 (div (+ .cse0 (* (- 1) .cse1)) 18446744073709551616)) .cse1)))))) is different from false [2022-07-19 22:03:38,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030859455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:38,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:03:38,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2022-07-19 22:03:38,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997179247] [2022-07-19 22:03:38,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:03:38,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 22:03:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:38,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 22:03:38,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1122, Unknown=2, NotChecked=138, Total=1406 [2022-07-19 22:03:38,784 INFO L87 Difference]: Start difference. First operand 156 states and 208 transitions. Second operand has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-19 22:03:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:41,153 INFO L93 Difference]: Finished difference Result 313 states and 449 transitions. [2022-07-19 22:03:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-19 22:03:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) Word has length 57 [2022-07-19 22:03:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:41,157 INFO L225 Difference]: With dead ends: 313 [2022-07-19 22:03:41,157 INFO L226 Difference]: Without dead ends: 244 [2022-07-19 22:03:41,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=292, Invalid=2470, Unknown=2, NotChecked=206, Total=2970 [2022-07-19 22:03:41,159 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 125 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:41,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1642 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1035 Invalid, 0 Unknown, 457 Unchecked, 1.2s Time] [2022-07-19 22:03:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-19 22:03:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 170. [2022-07-19 22:03:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 118 states have (on average 1.228813559322034) internal successors, (145), 121 states have internal predecessors, (145), 38 states have call successors, (38), 14 states have call predecessors, (38), 13 states have return successors, (47), 34 states have call predecessors, (47), 35 states have call successors, (47) [2022-07-19 22:03:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2022-07-19 22:03:41,181 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 57 [2022-07-19 22:03:41,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:41,181 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2022-07-19 22:03:41,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-19 22:03:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2022-07-19 22:03:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 22:03:41,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:41,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:41,223 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-19 22:03:41,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:41,402 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:41,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1565075525, now seen corresponding path program 2 times [2022-07-19 22:03:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:41,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305360689] [2022-07-19 22:03:41,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:41,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:41,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:03:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:41,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:03:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:41,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 22:03:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:41,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:03:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 22:03:41,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:41,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305360689] [2022-07-19 22:03:41,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305360689] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:41,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233793925] [2022-07-19 22:03:41,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:03:41,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:41,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:41,649 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-19 22:03:41,651 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-19 22:03:42,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 22:03:42,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:03:42,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 22:03:42,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 22:03:42,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:03:42,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233793925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:42,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:03:42,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2022-07-19 22:03:42,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893006270] [2022-07-19 22:03:42,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:42,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:03:42,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:42,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:03:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:03:42,425 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 22:03:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:42,534 INFO L93 Difference]: Finished difference Result 238 states and 327 transitions. [2022-07-19 22:03:42,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:03:42,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 61 [2022-07-19 22:03:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:42,536 INFO L225 Difference]: With dead ends: 238 [2022-07-19 22:03:42,536 INFO L226 Difference]: Without dead ends: 170 [2022-07-19 22:03:42,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:03:42,537 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:42,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 779 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:03:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-19 22:03:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-07-19 22:03:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 118 states have (on average 1.2203389830508475) internal successors, (144), 121 states have internal predecessors, (144), 38 states have call successors, (38), 14 states have call predecessors, (38), 13 states have return successors, (51), 34 states have call predecessors, (51), 35 states have call successors, (51) [2022-07-19 22:03:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2022-07-19 22:03:42,557 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 61 [2022-07-19 22:03:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:42,557 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2022-07-19 22:03:42,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 22:03:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2022-07-19 22:03:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 22:03:42,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:42,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:42,590 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-19 22:03:42,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:42,784 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1300919918, now seen corresponding path program 1 times [2022-07-19 22:03:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:42,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97998846] [2022-07-19 22:03:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:42,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:03:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:03:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 22:03:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:03:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 22:03:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 22:03:43,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:43,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97998846] [2022-07-19 22:03:43,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97998846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:43,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:03:43,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:03:43,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534901207] [2022-07-19 22:03:43,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:43,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:03:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:43,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:03:43,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:03:43,059 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 22:03:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:43,283 INFO L93 Difference]: Finished difference Result 288 states and 411 transitions. [2022-07-19 22:03:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:03:43,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-07-19 22:03:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:43,285 INFO L225 Difference]: With dead ends: 288 [2022-07-19 22:03:43,285 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 22:03:43,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:03:43,287 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 38 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:43,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 391 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:03:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 22:03:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 162. [2022-07-19 22:03:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 113 states have (on average 1.2123893805309736) internal successors, (137), 115 states have internal predecessors, (137), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (47), 32 states have call predecessors, (47), 32 states have call successors, (47) [2022-07-19 22:03:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 219 transitions. [2022-07-19 22:03:43,310 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 219 transitions. Word has length 64 [2022-07-19 22:03:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:43,311 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 219 transitions. [2022-07-19 22:03:43,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 22:03:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 219 transitions. [2022-07-19 22:03:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 22:03:43,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:43,312 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:43,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:03:43,313 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:43,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash -145583488, now seen corresponding path program 1 times [2022-07-19 22:03:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:43,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793527793] [2022-07-19 22:03:43,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:43,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:03:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:03:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 22:03:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:03:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 22:03:43,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:43,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793527793] [2022-07-19 22:03:43,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793527793] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:43,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577003277] [2022-07-19 22:03:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:43,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:43,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:43,528 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-19 22:03:43,530 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-19 22:03:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:43,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 2534 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 22:03:43,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:03:44,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:03:44,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577003277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:44,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:03:44,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-07-19 22:03:44,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438201731] [2022-07-19 22:03:44,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:44,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:03:44,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:44,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:03:44,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:03:44,060 INFO L87 Difference]: Start difference. First operand 162 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:03:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:44,232 INFO L93 Difference]: Finished difference Result 258 states and 361 transitions. [2022-07-19 22:03:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:03:44,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2022-07-19 22:03:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:44,234 INFO L225 Difference]: With dead ends: 258 [2022-07-19 22:03:44,235 INFO L226 Difference]: Without dead ends: 162 [2022-07-19 22:03:44,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:03:44,236 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 15 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:44,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 330 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-07-19 22:03:44,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-19 22:03:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-19 22:03:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 115 states have internal predecessors, (136), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (47), 32 states have call predecessors, (47), 32 states have call successors, (47) [2022-07-19 22:03:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 218 transitions. [2022-07-19 22:03:44,253 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 218 transitions. Word has length 63 [2022-07-19 22:03:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:44,253 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 218 transitions. [2022-07-19 22:03:44,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:03:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 218 transitions. [2022-07-19 22:03:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 22:03:44,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:44,255 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:44,278 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-19 22:03:44,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:44,468 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:44,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash 556016386, now seen corresponding path program 1 times [2022-07-19 22:03:44,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:44,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311954373] [2022-07-19 22:03:44,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:44,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:03:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:03:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 22:03:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:03:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 22:03:45,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:45,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311954373] [2022-07-19 22:03:45,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311954373] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:45,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752385378] [2022-07-19 22:03:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:45,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:45,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:45,260 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-19 22:03:45,288 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-19 22:03:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:45,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 2539 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-19 22:03:45,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:45,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:03:46,140 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-19 22:03:46,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 1 [2022-07-19 22:03:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 22:03:46,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:03:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:03:46,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752385378] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:03:46,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:03:46,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2022-07-19 22:03:46,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502238953] [2022-07-19 22:03:46,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:03:46,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 22:03:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 22:03:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2022-07-19 22:03:46,475 INFO L87 Difference]: Start difference. First operand 162 states and 218 transitions. Second operand has 30 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 30 states have internal predecessors, (104), 9 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-19 22:03:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:49,584 INFO L93 Difference]: Finished difference Result 353 states and 501 transitions. [2022-07-19 22:03:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-19 22:03:49,585 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 30 states have internal predecessors, (104), 9 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) Word has length 63 [2022-07-19 22:03:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:49,587 INFO L225 Difference]: With dead ends: 353 [2022-07-19 22:03:49,587 INFO L226 Difference]: Without dead ends: 245 [2022-07-19 22:03:49,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=513, Invalid=2909, Unknown=0, NotChecked=0, Total=3422 [2022-07-19 22:03:49,589 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 270 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:49,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1079 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1934 Invalid, 0 Unknown, 367 Unchecked, 1.8s Time] [2022-07-19 22:03:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-19 22:03:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 161. [2022-07-19 22:03:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (45), 32 states have call predecessors, (45), 32 states have call successors, (45) [2022-07-19 22:03:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2022-07-19 22:03:49,608 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 63 [2022-07-19 22:03:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:49,609 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2022-07-19 22:03:49,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 30 states have internal predecessors, (104), 9 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-19 22:03:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2022-07-19 22:03:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 22:03:49,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:49,611 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:49,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-19 22:03:49,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:49,827 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1118956732, now seen corresponding path program 1 times [2022-07-19 22:03:49,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:49,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280964761] [2022-07-19 22:03:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:03:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:03:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:03:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:03:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:03:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:03:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 22:03:50,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:50,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280964761] [2022-07-19 22:03:50,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280964761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:50,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:03:50,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:03:50,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017219750] [2022-07-19 22:03:50,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:50,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:03:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:50,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:03:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:03:50,075 INFO L87 Difference]: Start difference. First operand 161 states and 210 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:03:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:50,124 INFO L93 Difference]: Finished difference Result 216 states and 277 transitions. [2022-07-19 22:03:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:03:50,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2022-07-19 22:03:50,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:50,127 INFO L225 Difference]: With dead ends: 216 [2022-07-19 22:03:50,127 INFO L226 Difference]: Without dead ends: 161 [2022-07-19 22:03:50,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:03:50,128 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:50,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 362 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:03:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-19 22:03:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-19 22:03:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2022-07-19 22:03:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 209 transitions. [2022-07-19 22:03:50,145 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 209 transitions. Word has length 65 [2022-07-19 22:03:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:50,146 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 209 transitions. [2022-07-19 22:03:50,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:03:50,146 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 209 transitions. [2022-07-19 22:03:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 22:03:50,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:50,149 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:50,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 22:03:50,149 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:50,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1635963807, now seen corresponding path program 1 times [2022-07-19 22:03:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:50,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575975694] [2022-07-19 22:03:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:03:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:03:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:03:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:03:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:03:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:03:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:03:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 22:03:50,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:50,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575975694] [2022-07-19 22:03:50,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575975694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:03:50,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:03:50,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:03:50,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164466513] [2022-07-19 22:03:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:03:50,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:03:50,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:50,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:03:50,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:03:50,363 INFO L87 Difference]: Start difference. First operand 161 states and 209 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-19 22:03:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:03:50,449 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2022-07-19 22:03:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:03:50,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 67 [2022-07-19 22:03:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:03:50,451 INFO L225 Difference]: With dead ends: 169 [2022-07-19 22:03:50,451 INFO L226 Difference]: Without dead ends: 167 [2022-07-19 22:03:50,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:03:50,452 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 15 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:03:50,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 683 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:03:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-19 22:03:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2022-07-19 22:03:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 117 states have internal predecessors, (133), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (45), 33 states have call predecessors, (45), 33 states have call successors, (45) [2022-07-19 22:03:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2022-07-19 22:03:50,470 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 67 [2022-07-19 22:03:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:03:50,470 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2022-07-19 22:03:50,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-19 22:03:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2022-07-19 22:03:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-19 22:03:50,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:03:50,472 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:03:50,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 22:03:50,473 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:03:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:03:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash 701340153, now seen corresponding path program 1 times [2022-07-19 22:03:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:03:50,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527372569] [2022-07-19 22:03:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:50,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:03:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:03:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:03:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:03:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:03:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:03:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:03:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:03:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:03:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 22:03:51,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:03:51,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527372569] [2022-07-19 22:03:51,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527372569] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:51,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651164597] [2022-07-19 22:03:51,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:03:51,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:03:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:03:51,008 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-19 22:03:51,033 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-19 22:03:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:03:51,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 2554 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-19 22:03:51,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:03:51,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:03:51,593 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:03:51,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:03:51,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 22:03:51,966 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-19 22:03:51,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-07-19 22:03:52,026 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:03:52,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:03:52,303 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:03:52,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 22:03:52,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-19 22:03:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 22:03:55,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:03:56,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_778) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset| 8)) 0))) is different from false [2022-07-19 22:03:56,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651164597] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:03:56,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:03:56,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2022-07-19 22:03:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776386316] [2022-07-19 22:03:56,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:03:56,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 22:03:56,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:03:56,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 22:03:56,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1412, Unknown=2, NotChecked=76, Total=1640 [2022-07-19 22:03:56,300 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 12 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-19 22:04:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:22,864 INFO L93 Difference]: Finished difference Result 400 states and 570 transitions. [2022-07-19 22:04:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-19 22:04:22,865 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 12 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) Word has length 68 [2022-07-19 22:04:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:22,867 INFO L225 Difference]: With dead ends: 400 [2022-07-19 22:04:22,867 INFO L226 Difference]: Without dead ends: 331 [2022-07-19 22:04:22,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 84 SyntacticMatches, 13 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2227 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=787, Invalid=6692, Unknown=7, NotChecked=170, Total=7656 [2022-07-19 22:04:22,870 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 347 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1407 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:22,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 645 Invalid, 4464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2618 Invalid, 0 Unknown, 1407 Unchecked, 2.2s Time] [2022-07-19 22:04:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-19 22:04:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 191. [2022-07-19 22:04:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 135 states have (on average 1.162962962962963) internal successors, (157), 138 states have internal predecessors, (157), 37 states have call successors, (37), 19 states have call predecessors, (37), 18 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2022-07-19 22:04:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 241 transitions. [2022-07-19 22:04:22,925 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 241 transitions. Word has length 68 [2022-07-19 22:04:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:22,926 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 241 transitions. [2022-07-19 22:04:22,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 12 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-19 22:04:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2022-07-19 22:04:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-19 22:04:22,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:22,927 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:22,959 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-19 22:04:23,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 22:04:23,140 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:23,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1153679959, now seen corresponding path program 1 times [2022-07-19 22:04:23,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:23,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179226511] [2022-07-19 22:04:23,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:23,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 22:04:23,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:23,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179226511] [2022-07-19 22:04:23,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179226511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:23,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:23,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:04:23,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194627157] [2022-07-19 22:04:23,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:23,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:04:23,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:23,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:04:23,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:04:23,369 INFO L87 Difference]: Start difference. First operand 191 states and 241 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:04:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:23,585 INFO L93 Difference]: Finished difference Result 254 states and 326 transitions. [2022-07-19 22:04:23,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:04:23,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-07-19 22:04:23,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:23,587 INFO L225 Difference]: With dead ends: 254 [2022-07-19 22:04:23,588 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 22:04:23,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:04:23,589 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 40 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:23,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 375 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:04:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 22:04:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2022-07-19 22:04:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 136 states have (on average 1.161764705882353) internal successors, (158), 141 states have internal predecessors, (158), 42 states have call successors, (42), 19 states have call predecessors, (42), 18 states have return successors, (54), 36 states have call predecessors, (54), 39 states have call successors, (54) [2022-07-19 22:04:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 254 transitions. [2022-07-19 22:04:23,611 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 254 transitions. Word has length 71 [2022-07-19 22:04:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:23,612 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 254 transitions. [2022-07-19 22:04:23,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:04:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 254 transitions. [2022-07-19 22:04:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-19 22:04:23,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:23,615 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:23,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 22:04:23,615 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:23,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:23,616 INFO L85 PathProgramCache]: Analyzing trace with hash -452080085, now seen corresponding path program 1 times [2022-07-19 22:04:23,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:23,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590467134] [2022-07-19 22:04:23,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:23,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:23,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:24,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:24,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:24,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:24,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 22:04:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:24,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590467134] [2022-07-19 22:04:24,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590467134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:24,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976983268] [2022-07-19 22:04:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:24,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:24,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:24,166 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-19 22:04:24,167 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-19 22:04:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:24,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-19 22:04:24,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:24,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:04:25,125 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:04:25,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 36 [2022-07-19 22:04:25,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-19 22:04:25,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-19 22:04:25,240 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:04:25,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2022-07-19 22:04:25,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-07-19 22:04:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 22:04:25,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:04:26,142 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:04:26,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2022-07-19 22:04:26,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:04:26,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-07-19 22:04:26,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-07-19 22:04:26,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:04:26,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-07-19 22:04:26,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-19 22:04:26,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-19 22:04:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 22:04:26,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976983268] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:04:26,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:04:26,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 37 [2022-07-19 22:04:26,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040000971] [2022-07-19 22:04:26,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:04:26,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-19 22:04:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:26,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-19 22:04:26,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 22:04:26,597 INFO L87 Difference]: Start difference. First operand 197 states and 254 transitions. Second operand has 37 states, 33 states have (on average 2.787878787878788) internal successors, (92), 36 states have internal predecessors, (92), 15 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 10 states have call predecessors, (22), 14 states have call successors, (22) [2022-07-19 22:04:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:30,178 INFO L93 Difference]: Finished difference Result 392 states and 542 transitions. [2022-07-19 22:04:30,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-19 22:04:30,179 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 2.787878787878788) internal successors, (92), 36 states have internal predecessors, (92), 15 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 10 states have call predecessors, (22), 14 states have call successors, (22) Word has length 71 [2022-07-19 22:04:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:30,181 INFO L225 Difference]: With dead ends: 392 [2022-07-19 22:04:30,181 INFO L226 Difference]: Without dead ends: 316 [2022-07-19 22:04:30,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 134 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1651 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=586, Invalid=5114, Unknown=0, NotChecked=0, Total=5700 [2022-07-19 22:04:30,184 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 255 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 2258 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 2258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 532 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:30,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 2328 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 2258 Invalid, 0 Unknown, 532 Unchecked, 1.9s Time] [2022-07-19 22:04:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-07-19 22:04:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 229. [2022-07-19 22:04:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 156 states have (on average 1.1666666666666667) internal successors, (182), 165 states have internal predecessors, (182), 51 states have call successors, (51), 21 states have call predecessors, (51), 21 states have return successors, (65), 42 states have call predecessors, (65), 48 states have call successors, (65) [2022-07-19 22:04:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 298 transitions. [2022-07-19 22:04:30,218 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 298 transitions. Word has length 71 [2022-07-19 22:04:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:30,218 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 298 transitions. [2022-07-19 22:04:30,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 2.787878787878788) internal successors, (92), 36 states have internal predecessors, (92), 15 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 10 states have call predecessors, (22), 14 states have call successors, (22) [2022-07-19 22:04:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 298 transitions. [2022-07-19 22:04:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-19 22:04:30,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:30,220 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:30,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-19 22:04:30,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 22:04:30,439 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:30,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1701555945, now seen corresponding path program 1 times [2022-07-19 22:04:30,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:30,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788131891] [2022-07-19 22:04:30,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-19 22:04:30,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:30,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788131891] [2022-07-19 22:04:30,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788131891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:30,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:30,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:04:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018953557] [2022-07-19 22:04:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:30,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:04:30,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:04:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:04:30,647 INFO L87 Difference]: Start difference. First operand 229 states and 298 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 22:04:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:30,692 INFO L93 Difference]: Finished difference Result 255 states and 331 transitions. [2022-07-19 22:04:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:04:30,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2022-07-19 22:04:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:30,694 INFO L225 Difference]: With dead ends: 255 [2022-07-19 22:04:30,694 INFO L226 Difference]: Without dead ends: 226 [2022-07-19 22:04:30,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:04:30,695 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 27 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:30,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 257 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:04:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-19 22:04:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2022-07-19 22:04:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 151 states have (on average 1.1655629139072847) internal successors, (176), 160 states have internal predecessors, (176), 49 states have call successors, (49), 20 states have call predecessors, (49), 20 states have return successors, (62), 40 states have call predecessors, (62), 46 states have call successors, (62) [2022-07-19 22:04:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 287 transitions. [2022-07-19 22:04:30,728 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 287 transitions. Word has length 80 [2022-07-19 22:04:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:30,729 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 287 transitions. [2022-07-19 22:04:30,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 22:04:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 287 transitions. [2022-07-19 22:04:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-19 22:04:30,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:30,733 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:30,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 22:04:30,733 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1390033412, now seen corresponding path program 1 times [2022-07-19 22:04:30,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:30,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160721504] [2022-07-19 22:04:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:30,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-19 22:04:30,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:30,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160721504] [2022-07-19 22:04:30,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160721504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:30,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:30,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:04:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179866280] [2022-07-19 22:04:30,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:30,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:04:30,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:04:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:04:30,964 INFO L87 Difference]: Start difference. First operand 221 states and 287 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 22:04:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:31,042 INFO L93 Difference]: Finished difference Result 229 states and 295 transitions. [2022-07-19 22:04:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:04:31,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2022-07-19 22:04:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:31,044 INFO L225 Difference]: With dead ends: 229 [2022-07-19 22:04:31,044 INFO L226 Difference]: Without dead ends: 227 [2022-07-19 22:04:31,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:04:31,045 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 15 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:31,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 670 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:04:31,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-19 22:04:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2022-07-19 22:04:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 154 states have (on average 1.1623376623376624) internal successors, (179), 163 states have internal predecessors, (179), 50 states have call successors, (50), 21 states have call predecessors, (50), 21 states have return successors, (63), 41 states have call predecessors, (63), 47 states have call successors, (63) [2022-07-19 22:04:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 292 transitions. [2022-07-19 22:04:31,076 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 292 transitions. Word has length 82 [2022-07-19 22:04:31,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:31,076 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 292 transitions. [2022-07-19 22:04:31,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 22:04:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 292 transitions. [2022-07-19 22:04:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 22:04:31,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:31,078 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:31,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 22:04:31,079 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:31,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:31,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1172549180, now seen corresponding path program 1 times [2022-07-19 22:04:31,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:31,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076164667] [2022-07-19 22:04:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:31,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-19 22:04:31,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:31,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076164667] [2022-07-19 22:04:31,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076164667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:31,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:31,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:04:31,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705343856] [2022-07-19 22:04:31,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:31,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:04:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:04:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:04:31,325 INFO L87 Difference]: Start difference. First operand 226 states and 292 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 22:04:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:31,720 INFO L93 Difference]: Finished difference Result 276 states and 363 transitions. [2022-07-19 22:04:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:04:31,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2022-07-19 22:04:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:31,723 INFO L225 Difference]: With dead ends: 276 [2022-07-19 22:04:31,723 INFO L226 Difference]: Without dead ends: 250 [2022-07-19 22:04:31,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:04:31,724 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 51 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:31,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 598 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:04:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-19 22:04:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 233. [2022-07-19 22:04:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 157 states have (on average 1.1592356687898089) internal successors, (182), 166 states have internal predecessors, (182), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (67), 45 states have call predecessors, (67), 51 states have call successors, (67) [2022-07-19 22:04:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 303 transitions. [2022-07-19 22:04:31,764 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 303 transitions. Word has length 86 [2022-07-19 22:04:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:31,764 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 303 transitions. [2022-07-19 22:04:31,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 22:04:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 303 transitions. [2022-07-19 22:04:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 22:04:31,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:31,767 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:31,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 22:04:31,767 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:31,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 755723522, now seen corresponding path program 1 times [2022-07-19 22:04:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:31,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962674572] [2022-07-19 22:04:31,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:32,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:32,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 22:04:32,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:32,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962674572] [2022-07-19 22:04:32,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962674572] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:32,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371624055] [2022-07-19 22:04:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:32,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:32,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:32,168 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-19 22:04:32,201 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-19 22:04:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:37,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 22:04:37,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:37,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:04:37,232 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 22:04:37,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 22:04:37,291 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-19 22:04:37,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-19 22:04:37,501 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 22:04:37,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 22:04:37,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 22:04:37,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:04:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 35 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:04:38,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:04:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-19 22:04:38,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371624055] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:04:38,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:04:38,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 11] total 31 [2022-07-19 22:04:38,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866616649] [2022-07-19 22:04:38,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:04:38,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-19 22:04:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:38,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-19 22:04:38,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2022-07-19 22:04:38,341 INFO L87 Difference]: Start difference. First operand 233 states and 303 transitions. Second operand has 31 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 28 states have internal predecessors, (102), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-19 22:04:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:39,196 INFO L93 Difference]: Finished difference Result 316 states and 420 transitions. [2022-07-19 22:04:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 22:04:39,197 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 28 states have internal predecessors, (102), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) Word has length 86 [2022-07-19 22:04:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:39,198 INFO L225 Difference]: With dead ends: 316 [2022-07-19 22:04:39,198 INFO L226 Difference]: Without dead ends: 282 [2022-07-19 22:04:39,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 165 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=1506, Unknown=0, NotChecked=0, Total=1722 [2022-07-19 22:04:39,199 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 73 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:39,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1758 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 625 Invalid, 0 Unknown, 411 Unchecked, 0.5s Time] [2022-07-19 22:04:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-19 22:04:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 246. [2022-07-19 22:04:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 164 states have (on average 1.1585365853658536) internal successors, (190), 175 states have internal predecessors, (190), 59 states have call successors, (59), 22 states have call predecessors, (59), 22 states have return successors, (72), 48 states have call predecessors, (72), 56 states have call successors, (72) [2022-07-19 22:04:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 321 transitions. [2022-07-19 22:04:39,251 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 321 transitions. Word has length 86 [2022-07-19 22:04:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:39,251 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 321 transitions. [2022-07-19 22:04:39,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 28 states have internal predecessors, (102), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-19 22:04:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 321 transitions. [2022-07-19 22:04:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-19 22:04:39,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:39,254 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:39,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-19 22:04:39,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:39,466 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:39,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:39,466 INFO L85 PathProgramCache]: Analyzing trace with hash -98466641, now seen corresponding path program 1 times [2022-07-19 22:04:39,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:39,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418988483] [2022-07-19 22:04:39,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:39,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:39,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:04:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:39,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:39,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:04:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:39,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 22:04:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:04:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:39,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:04:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:39,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 22:04:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:39,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:04:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-19 22:04:39,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:39,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418988483] [2022-07-19 22:04:39,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418988483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:39,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427191473] [2022-07-19 22:04:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:39,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:39,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:39,728 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-19 22:04:39,759 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-19 22:04:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:40,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 2633 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 22:04:40,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 22:04:40,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:04:40,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427191473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:40,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:04:40,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-19 22:04:40,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658999263] [2022-07-19 22:04:40,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:40,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:04:40,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:40,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:04:40,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:04:40,273 INFO L87 Difference]: Start difference. First operand 246 states and 321 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 22:04:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:40,403 INFO L93 Difference]: Finished difference Result 364 states and 487 transitions. [2022-07-19 22:04:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:04:40,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 85 [2022-07-19 22:04:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:40,406 INFO L225 Difference]: With dead ends: 364 [2022-07-19 22:04:40,406 INFO L226 Difference]: Without dead ends: 241 [2022-07-19 22:04:40,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:04:40,410 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:40,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 774 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:04:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-19 22:04:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-07-19 22:04:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 160 states have (on average 1.15625) internal successors, (185), 170 states have internal predecessors, (185), 59 states have call successors, (59), 22 states have call predecessors, (59), 21 states have return successors, (69), 48 states have call predecessors, (69), 56 states have call successors, (69) [2022-07-19 22:04:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 313 transitions. [2022-07-19 22:04:40,451 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 313 transitions. Word has length 85 [2022-07-19 22:04:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:40,451 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 313 transitions. [2022-07-19 22:04:40,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 22:04:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 313 transitions. [2022-07-19 22:04:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-19 22:04:40,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:40,453 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:40,478 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-19 22:04:40,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:40,666 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:40,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1314150920, now seen corresponding path program 2 times [2022-07-19 22:04:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:40,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244601429] [2022-07-19 22:04:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:41,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:41,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:04:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:41,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:41,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:04:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:04:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:04:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:04:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 22:04:41,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:41,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244601429] [2022-07-19 22:04:41,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244601429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:41,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:41,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-19 22:04:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128493586] [2022-07-19 22:04:41,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:41,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 22:04:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:41,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 22:04:41,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:04:41,759 INFO L87 Difference]: Start difference. First operand 241 states and 313 transitions. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 22:04:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:43,976 INFO L93 Difference]: Finished difference Result 389 states and 527 transitions. [2022-07-19 22:04:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 22:04:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 87 [2022-07-19 22:04:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:43,978 INFO L225 Difference]: With dead ends: 389 [2022-07-19 22:04:43,978 INFO L226 Difference]: Without dead ends: 318 [2022-07-19 22:04:43,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=1137, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 22:04:43,980 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 200 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:43,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 673 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-19 22:04:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-07-19 22:04:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 248. [2022-07-19 22:04:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 166 states have (on average 1.1566265060240963) internal successors, (192), 177 states have internal predecessors, (192), 59 states have call successors, (59), 22 states have call predecessors, (59), 22 states have return successors, (71), 48 states have call predecessors, (71), 56 states have call successors, (71) [2022-07-19 22:04:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 322 transitions. [2022-07-19 22:04:44,018 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 322 transitions. Word has length 87 [2022-07-19 22:04:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:44,018 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 322 transitions. [2022-07-19 22:04:44,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 22:04:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 322 transitions. [2022-07-19 22:04:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-19 22:04:44,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:44,021 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:44,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 22:04:44,021 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1572316358, now seen corresponding path program 1 times [2022-07-19 22:04:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:44,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311565944] [2022-07-19 22:04:44,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:04:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:04:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:04:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:04:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:04:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 22:04:44,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:44,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311565944] [2022-07-19 22:04:44,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311565944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:44,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522668116] [2022-07-19 22:04:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:44,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:44,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:44,495 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-19 22:04:44,523 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-19 22:04:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:44,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 22:04:44,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-19 22:04:44,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:04:44,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522668116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:44,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:04:44,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 20 [2022-07-19 22:04:44,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165727368] [2022-07-19 22:04:44,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:44,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:04:44,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:04:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:04:44,994 INFO L87 Difference]: Start difference. First operand 248 states and 322 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-19 22:04:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:45,117 INFO L93 Difference]: Finished difference Result 366 states and 498 transitions. [2022-07-19 22:04:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:04:45,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2022-07-19 22:04:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:45,122 INFO L225 Difference]: With dead ends: 366 [2022-07-19 22:04:45,122 INFO L226 Difference]: Without dead ends: 241 [2022-07-19 22:04:45,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:04:45,125 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:45,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 246 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-07-19 22:04:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-19 22:04:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-07-19 22:04:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 160 states have (on average 1.14375) internal successors, (183), 170 states have internal predecessors, (183), 59 states have call successors, (59), 22 states have call predecessors, (59), 21 states have return successors, (66), 48 states have call predecessors, (66), 56 states have call successors, (66) [2022-07-19 22:04:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 308 transitions. [2022-07-19 22:04:45,162 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 308 transitions. Word has length 87 [2022-07-19 22:04:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:45,163 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 308 transitions. [2022-07-19 22:04:45,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-19 22:04:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 308 transitions. [2022-07-19 22:04:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-19 22:04:45,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:45,165 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:45,193 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-19 22:04:45,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-19 22:04:45,391 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:45,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash -375331136, now seen corresponding path program 1 times [2022-07-19 22:04:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:45,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678611783] [2022-07-19 22:04:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:04:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:04:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:04:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:04:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:04:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 22:04:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:04:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:45,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:04:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 22:04:46,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:46,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678611783] [2022-07-19 22:04:46,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678611783] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:46,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444541159] [2022-07-19 22:04:46,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:46,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:46,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:46,016 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-19 22:04:46,045 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-19 22:04:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:46,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-19 22:04:46,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:46,583 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-19 22:04:46,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-19 22:04:46,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-19 22:04:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-19 22:04:47,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:04:47,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444541159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:47,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:04:47,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 33 [2022-07-19 22:04:47,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529122285] [2022-07-19 22:04:47,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:47,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:04:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:47,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:04:47,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 22:04:47,036 INFO L87 Difference]: Start difference. First operand 241 states and 308 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 22:04:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:47,557 INFO L93 Difference]: Finished difference Result 454 states and 562 transitions. [2022-07-19 22:04:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:04:47,558 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 88 [2022-07-19 22:04:47,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:47,560 INFO L225 Difference]: With dead ends: 454 [2022-07-19 22:04:47,560 INFO L226 Difference]: Without dead ends: 344 [2022-07-19 22:04:47,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=1258, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 22:04:47,562 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 180 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 589 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:47,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 835 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 462 Invalid, 0 Unknown, 589 Unchecked, 0.4s Time] [2022-07-19 22:04:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-19 22:04:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 308. [2022-07-19 22:04:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 206 states have (on average 1.116504854368932) internal successors, (230), 218 states have internal predecessors, (230), 71 states have call successors, (71), 30 states have call predecessors, (71), 30 states have return successors, (75), 59 states have call predecessors, (75), 65 states have call successors, (75) [2022-07-19 22:04:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 376 transitions. [2022-07-19 22:04:47,607 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 376 transitions. Word has length 88 [2022-07-19 22:04:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:47,608 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 376 transitions. [2022-07-19 22:04:47,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 22:04:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 376 transitions. [2022-07-19 22:04:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-19 22:04:47,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:47,610 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:47,631 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-19 22:04:47,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-19 22:04:47,811 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:47,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash -253022058, now seen corresponding path program 1 times [2022-07-19 22:04:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:47,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812293880] [2022-07-19 22:04:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:04:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-19 22:04:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:47,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812293880] [2022-07-19 22:04:47,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812293880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:47,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:47,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 22:04:47,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110757207] [2022-07-19 22:04:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:47,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:04:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:04:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:04:47,964 INFO L87 Difference]: Start difference. First operand 308 states and 376 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-19 22:04:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:48,021 INFO L93 Difference]: Finished difference Result 334 states and 409 transitions. [2022-07-19 22:04:48,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:04:48,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2022-07-19 22:04:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:48,024 INFO L225 Difference]: With dead ends: 334 [2022-07-19 22:04:48,024 INFO L226 Difference]: Without dead ends: 310 [2022-07-19 22:04:48,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:04:48,025 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:48,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:04:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-19 22:04:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2022-07-19 22:04:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 208 states have (on average 1.1153846153846154) internal successors, (232), 220 states have internal predecessors, (232), 71 states have call successors, (71), 30 states have call predecessors, (71), 30 states have return successors, (75), 59 states have call predecessors, (75), 65 states have call successors, (75) [2022-07-19 22:04:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 378 transitions. [2022-07-19 22:04:48,075 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 378 transitions. Word has length 90 [2022-07-19 22:04:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:48,076 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 378 transitions. [2022-07-19 22:04:48,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-19 22:04:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 378 transitions. [2022-07-19 22:04:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-19 22:04:48,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:48,078 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:48,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 22:04:48,078 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:48,078 INFO L85 PathProgramCache]: Analyzing trace with hash -266130098, now seen corresponding path program 1 times [2022-07-19 22:04:48,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:48,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152364457] [2022-07-19 22:04:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:48,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:04:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-19 22:04:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:48,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152364457] [2022-07-19 22:04:48,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152364457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:48,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:48,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:04:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303258983] [2022-07-19 22:04:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:48,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:04:48,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:04:48,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:04:48,321 INFO L87 Difference]: Start difference. First operand 310 states and 378 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 22:04:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:48,617 INFO L93 Difference]: Finished difference Result 378 states and 474 transitions. [2022-07-19 22:04:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:04:48,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2022-07-19 22:04:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:48,620 INFO L225 Difference]: With dead ends: 378 [2022-07-19 22:04:48,620 INFO L226 Difference]: Without dead ends: 376 [2022-07-19 22:04:48,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:04:48,621 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 24 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:48,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 754 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:04:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-19 22:04:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 352. [2022-07-19 22:04:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 231 states have (on average 1.121212121212121) internal successors, (259), 244 states have internal predecessors, (259), 88 states have call successors, (88), 32 states have call predecessors, (88), 32 states have return successors, (92), 75 states have call predecessors, (92), 82 states have call successors, (92) [2022-07-19 22:04:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 439 transitions. [2022-07-19 22:04:48,691 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 439 transitions. Word has length 90 [2022-07-19 22:04:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:48,691 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 439 transitions. [2022-07-19 22:04:48,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 22:04:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 439 transitions. [2022-07-19 22:04:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-19 22:04:48,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:48,693 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:48,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 22:04:48,694 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash -195763756, now seen corresponding path program 1 times [2022-07-19 22:04:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:48,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381584711] [2022-07-19 22:04:48,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:48,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:04:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-19 22:04:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:49,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381584711] [2022-07-19 22:04:49,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381584711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:49,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:49,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:04:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909279612] [2022-07-19 22:04:49,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:49,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:04:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:49,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:04:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:04:49,137 INFO L87 Difference]: Start difference. First operand 352 states and 439 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 22:04:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:50,034 INFO L93 Difference]: Finished difference Result 385 states and 485 transitions. [2022-07-19 22:04:50,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:04:50,035 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 90 [2022-07-19 22:04:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:50,037 INFO L225 Difference]: With dead ends: 385 [2022-07-19 22:04:50,037 INFO L226 Difference]: Without dead ends: 383 [2022-07-19 22:04:50,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:04:50,038 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 63 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:50,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1018 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 22:04:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-19 22:04:50,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 370. [2022-07-19 22:04:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 241 states have (on average 1.1286307053941909) internal successors, (272), 255 states have internal predecessors, (272), 95 states have call successors, (95), 33 states have call predecessors, (95), 33 states have return successors, (99), 81 states have call predecessors, (99), 89 states have call successors, (99) [2022-07-19 22:04:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 466 transitions. [2022-07-19 22:04:50,110 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 466 transitions. Word has length 90 [2022-07-19 22:04:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:50,110 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 466 transitions. [2022-07-19 22:04:50,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 22:04:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 466 transitions. [2022-07-19 22:04:50,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-19 22:04:50,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:50,113 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:50,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 22:04:50,114 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash -747210356, now seen corresponding path program 1 times [2022-07-19 22:04:50,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:50,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103992273] [2022-07-19 22:04:50,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:50,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:04:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-19 22:04:50,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:50,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103992273] [2022-07-19 22:04:50,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103992273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:50,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:50,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:04:50,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020218762] [2022-07-19 22:04:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:50,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:04:50,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:50,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:04:50,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:04:50,669 INFO L87 Difference]: Start difference. First operand 370 states and 466 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 22:04:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:51,505 INFO L93 Difference]: Finished difference Result 485 states and 633 transitions. [2022-07-19 22:04:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:04:51,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2022-07-19 22:04:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:51,508 INFO L225 Difference]: With dead ends: 485 [2022-07-19 22:04:51,508 INFO L226 Difference]: Without dead ends: 449 [2022-07-19 22:04:51,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:04:51,509 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 20 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:51,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 571 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 22:04:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-07-19 22:04:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 412. [2022-07-19 22:04:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 261 states have (on average 1.1226053639846743) internal successors, (293), 274 states have internal predecessors, (293), 117 states have call successors, (117), 33 states have call predecessors, (117), 33 states have return successors, (125), 104 states have call predecessors, (125), 111 states have call successors, (125) [2022-07-19 22:04:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 535 transitions. [2022-07-19 22:04:51,615 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 535 transitions. Word has length 90 [2022-07-19 22:04:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:51,616 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 535 transitions. [2022-07-19 22:04:51,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 22:04:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 535 transitions. [2022-07-19 22:04:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-19 22:04:51,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:51,618 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:51,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 22:04:51,618 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:51,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:51,619 INFO L85 PathProgramCache]: Analyzing trace with hash -676844014, now seen corresponding path program 1 times [2022-07-19 22:04:51,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:51,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398207280] [2022-07-19 22:04:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:51,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:04:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-19 22:04:52,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:52,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398207280] [2022-07-19 22:04:52,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398207280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:52,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:52,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:04:52,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365895950] [2022-07-19 22:04:52,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:52,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:04:52,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:52,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:04:52,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:04:52,251 INFO L87 Difference]: Start difference. First operand 412 states and 535 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 22:04:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:52,926 INFO L93 Difference]: Finished difference Result 443 states and 577 transitions. [2022-07-19 22:04:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:04:52,927 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 90 [2022-07-19 22:04:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:52,930 INFO L225 Difference]: With dead ends: 443 [2022-07-19 22:04:52,930 INFO L226 Difference]: Without dead ends: 441 [2022-07-19 22:04:52,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:04:52,931 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 31 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:52,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 870 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 22:04:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-07-19 22:04:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 424. [2022-07-19 22:04:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 267 states have (on average 1.1235955056179776) internal successors, (300), 280 states have internal predecessors, (300), 123 states have call successors, (123), 33 states have call predecessors, (123), 33 states have return successors, (131), 110 states have call predecessors, (131), 117 states have call successors, (131) [2022-07-19 22:04:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 554 transitions. [2022-07-19 22:04:53,052 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 554 transitions. Word has length 90 [2022-07-19 22:04:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:53,053 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 554 transitions. [2022-07-19 22:04:53,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 22:04:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 554 transitions. [2022-07-19 22:04:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-19 22:04:53,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:53,055 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:53,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 22:04:53,055 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash -689952054, now seen corresponding path program 1 times [2022-07-19 22:04:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:53,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000367988] [2022-07-19 22:04:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:04:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-19 22:04:53,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:53,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000367988] [2022-07-19 22:04:53,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000367988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:04:53,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384226094] [2022-07-19 22:04:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:53,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:53,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:04:53,480 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-19 22:04:53,482 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-19 22:04:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:53,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 2634 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-19 22:04:53,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:04:54,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2022-07-19 22:04:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 22:04:54,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:04:54,516 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-19 22:04:54,556 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 22:04:54,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-19 22:04:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-19 22:04:54,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384226094] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:04:54,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:04:54,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 22 [2022-07-19 22:04:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412206821] [2022-07-19 22:04:54,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:04:54,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 22:04:54,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:54,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 22:04:54,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:04:54,567 INFO L87 Difference]: Start difference. First operand 424 states and 554 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 10 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-19 22:04:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:56,286 INFO L93 Difference]: Finished difference Result 583 states and 786 transitions. [2022-07-19 22:04:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-19 22:04:56,287 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 10 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) Word has length 90 [2022-07-19 22:04:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:56,289 INFO L225 Difference]: With dead ends: 583 [2022-07-19 22:04:56,290 INFO L226 Difference]: Without dead ends: 555 [2022-07-19 22:04:56,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 186 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=328, Invalid=2024, Unknown=0, NotChecked=0, Total=2352 [2022-07-19 22:04:56,291 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 256 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:56,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1543 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1270 Invalid, 0 Unknown, 311 Unchecked, 1.0s Time] [2022-07-19 22:04:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-07-19 22:04:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 440. [2022-07-19 22:04:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 275 states have (on average 1.1163636363636364) internal successors, (307), 287 states have internal predecessors, (307), 131 states have call successors, (131), 33 states have call predecessors, (131), 33 states have return successors, (143), 119 states have call predecessors, (143), 125 states have call successors, (143) [2022-07-19 22:04:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 581 transitions. [2022-07-19 22:04:56,412 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 581 transitions. Word has length 90 [2022-07-19 22:04:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:56,412 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 581 transitions. [2022-07-19 22:04:56,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 10 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-19 22:04:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 581 transitions. [2022-07-19 22:04:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-19 22:04:56,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:56,414 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:56,447 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-19 22:04:56,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:04:56,640 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:56,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:56,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1680266801, now seen corresponding path program 1 times [2022-07-19 22:04:56,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:56,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596638613] [2022-07-19 22:04:56,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:56,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:04:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:56,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:04:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:56,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:04:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:56,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:04:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:04:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:04:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 22:04:56,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:56,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596638613] [2022-07-19 22:04:56,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596638613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:56,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:56,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:04:56,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771797234] [2022-07-19 22:04:56,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:56,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:04:56,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:56,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:04:56,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:04:56,907 INFO L87 Difference]: Start difference. First operand 440 states and 581 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-19 22:04:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:57,535 INFO L93 Difference]: Finished difference Result 446 states and 586 transitions. [2022-07-19 22:04:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:04:57,535 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2022-07-19 22:04:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:57,538 INFO L225 Difference]: With dead ends: 446 [2022-07-19 22:04:57,538 INFO L226 Difference]: Without dead ends: 444 [2022-07-19 22:04:57,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-19 22:04:57,539 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 62 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:57,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 637 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 22:04:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-07-19 22:04:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2022-07-19 22:04:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 278 states have (on average 1.1151079136690647) internal successors, (310), 290 states have internal predecessors, (310), 131 states have call successors, (131), 34 states have call predecessors, (131), 34 states have return successors, (143), 119 states have call predecessors, (143), 125 states have call successors, (143) [2022-07-19 22:04:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 584 transitions. [2022-07-19 22:04:57,693 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 584 transitions. Word has length 89 [2022-07-19 22:04:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:57,693 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 584 transitions. [2022-07-19 22:04:57,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-19 22:04:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 584 transitions. [2022-07-19 22:04:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-19 22:04:57,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:57,698 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:57,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 22:04:57,698 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1792661847, now seen corresponding path program 1 times [2022-07-19 22:04:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:57,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749222586] [2022-07-19 22:04:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:04:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:04:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-19 22:04:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:58,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749222586] [2022-07-19 22:04:58,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749222586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:58,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:58,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:04:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988453835] [2022-07-19 22:04:58,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:58,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:04:58,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:04:58,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:04:58,138 INFO L87 Difference]: Start difference. First operand 444 states and 584 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 22:04:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:58,773 INFO L93 Difference]: Finished difference Result 498 states and 655 transitions. [2022-07-19 22:04:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:04:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 96 [2022-07-19 22:04:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:58,776 INFO L225 Difference]: With dead ends: 498 [2022-07-19 22:04:58,777 INFO L226 Difference]: Without dead ends: 470 [2022-07-19 22:04:58,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:04:58,778 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 18 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:58,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 530 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 22:04:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-19 22:04:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 455. [2022-07-19 22:04:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 283 states have (on average 1.11660777385159) internal successors, (316), 295 states have internal predecessors, (316), 137 states have call successors, (137), 34 states have call predecessors, (137), 34 states have return successors, (149), 125 states have call predecessors, (149), 131 states have call successors, (149) [2022-07-19 22:04:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 602 transitions. [2022-07-19 22:04:58,905 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 602 transitions. Word has length 96 [2022-07-19 22:04:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:58,905 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 602 transitions. [2022-07-19 22:04:58,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 22:04:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 602 transitions. [2022-07-19 22:04:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-19 22:04:58,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:58,908 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:58,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 22:04:58,908 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:58,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1410948513, now seen corresponding path program 1 times [2022-07-19 22:04:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:58,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197700142] [2022-07-19 22:04:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:04:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:04:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:04:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:04:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:04:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:04:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:04:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:04:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:04:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:04:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:04:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:04:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:04:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-19 22:04:59,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:04:59,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197700142] [2022-07-19 22:04:59,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197700142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:04:59,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:04:59,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:04:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577996416] [2022-07-19 22:04:59,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:04:59,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:04:59,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:04:59,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:04:59,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:04:59,134 INFO L87 Difference]: Start difference. First operand 455 states and 602 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 22:04:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:04:59,478 INFO L93 Difference]: Finished difference Result 490 states and 645 transitions. [2022-07-19 22:04:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:04:59,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 96 [2022-07-19 22:04:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:04:59,482 INFO L225 Difference]: With dead ends: 490 [2022-07-19 22:04:59,482 INFO L226 Difference]: Without dead ends: 488 [2022-07-19 22:04:59,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:04:59,483 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 23 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:04:59,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 750 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:04:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-07-19 22:04:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 467. [2022-07-19 22:04:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 291 states have (on average 1.1134020618556701) internal successors, (324), 303 states have internal predecessors, (324), 139 states have call successors, (139), 36 states have call predecessors, (139), 36 states have return successors, (151), 127 states have call predecessors, (151), 133 states have call successors, (151) [2022-07-19 22:04:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 614 transitions. [2022-07-19 22:04:59,631 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 614 transitions. Word has length 96 [2022-07-19 22:04:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:04:59,631 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 614 transitions. [2022-07-19 22:04:59,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 22:04:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 614 transitions. [2022-07-19 22:04:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-19 22:04:59,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:04:59,634 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:04:59,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 22:04:59,634 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:04:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:04:59,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1751987097, now seen corresponding path program 1 times [2022-07-19 22:04:59,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:04:59,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187300281] [2022-07-19 22:04:59,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:04:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:04:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:05:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:05:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:05:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:05:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:05:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:05:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:05:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:05:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:05:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-19 22:05:00,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:00,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187300281] [2022-07-19 22:05:00,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187300281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:00,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:00,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 22:05:00,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921340948] [2022-07-19 22:05:00,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:00,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:05:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:00,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:05:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:05:00,204 INFO L87 Difference]: Start difference. First operand 467 states and 614 transitions. Second operand has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-19 22:05:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:00,952 INFO L93 Difference]: Finished difference Result 487 states and 638 transitions. [2022-07-19 22:05:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 22:05:00,953 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 96 [2022-07-19 22:05:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:00,954 INFO L225 Difference]: With dead ends: 487 [2022-07-19 22:05:00,955 INFO L226 Difference]: Without dead ends: 485 [2022-07-19 22:05:00,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-07-19 22:05:00,956 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 59 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:00,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1043 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 22:05:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-07-19 22:05:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 474. [2022-07-19 22:05:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 295 states have (on average 1.111864406779661) internal successors, (328), 308 states have internal predecessors, (328), 141 states have call successors, (141), 37 states have call predecessors, (141), 37 states have return successors, (153), 128 states have call predecessors, (153), 135 states have call successors, (153) [2022-07-19 22:05:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 622 transitions. [2022-07-19 22:05:01,098 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 622 transitions. Word has length 96 [2022-07-19 22:05:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:01,098 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 622 transitions. [2022-07-19 22:05:01,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-19 22:05:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 622 transitions. [2022-07-19 22:05:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-19 22:05:01,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:01,101 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:01,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-19 22:05:01,101 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:01,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1241388199, now seen corresponding path program 1 times [2022-07-19 22:05:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:01,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073510563] [2022-07-19 22:05:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:01,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:05:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:05:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:05:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:05:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:05:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:05:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:05:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:05:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:05:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-19 22:05:01,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:01,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073510563] [2022-07-19 22:05:01,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073510563] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:01,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158213286] [2022-07-19 22:05:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:01,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:01,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:01,461 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-19 22:05:01,462 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-19 22:05:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:01,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-19 22:05:01,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:02,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2022-07-19 22:05:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-19 22:05:02,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:05:02,538 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 22:05:02,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2022-07-19 22:05:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-19 22:05:02,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158213286] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:05:02,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:05:02,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 21 [2022-07-19 22:05:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139369115] [2022-07-19 22:05:02,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:05:02,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 22:05:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 22:05:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:05:02,547 INFO L87 Difference]: Start difference. First operand 474 states and 622 transitions. Second operand has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 10 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2022-07-19 22:05:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:04,291 INFO L93 Difference]: Finished difference Result 720 states and 914 transitions. [2022-07-19 22:05:04,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-19 22:05:04,293 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 10 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) Word has length 96 [2022-07-19 22:05:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:04,295 INFO L225 Difference]: With dead ends: 720 [2022-07-19 22:05:04,295 INFO L226 Difference]: Without dead ends: 543 [2022-07-19 22:05:04,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 201 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2022-07-19 22:05:04,297 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 186 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:04,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1035 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1307 Invalid, 0 Unknown, 206 Unchecked, 1.0s Time] [2022-07-19 22:05:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-19 22:05:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 454. [2022-07-19 22:05:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 286 states have (on average 1.0874125874125875) internal successors, (311), 296 states have internal predecessors, (311), 130 states have call successors, (130), 37 states have call predecessors, (130), 37 states have return successors, (142), 120 states have call predecessors, (142), 124 states have call successors, (142) [2022-07-19 22:05:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 583 transitions. [2022-07-19 22:05:04,409 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 583 transitions. Word has length 96 [2022-07-19 22:05:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:04,410 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 583 transitions. [2022-07-19 22:05:04,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 10 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2022-07-19 22:05:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 583 transitions. [2022-07-19 22:05:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-19 22:05:04,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:04,412 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:04,443 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-19 22:05:04,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:04,628 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash 263298865, now seen corresponding path program 1 times [2022-07-19 22:05:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:04,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052366088] [2022-07-19 22:05:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:04,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:05:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:05:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:05:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:05:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 22:05:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:05:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:05:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:05:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 22:05:05,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:05,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052366088] [2022-07-19 22:05:05,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052366088] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:05,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168216726] [2022-07-19 22:05:05,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:05,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:05,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:05,237 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-19 22:05:05,239 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-19 22:05:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:05,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 2683 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-19 22:05:05,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:05,785 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-19 22:05:09,980 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:05:09,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-19 22:05:09,988 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-19 22:05:10,034 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:05:10,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 27 [2022-07-19 22:05:10,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:05:10,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:10,414 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-19 22:05:10,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-07-19 22:05:10,436 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-19 22:05:10,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-07-19 22:05:10,442 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-19 22:05:10,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2022-07-19 22:05:10,474 INFO L356 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2022-07-19 22:05:10,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-19 22:05:10,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 22:05:10,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-07-19 22:05:10,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2022-07-19 22:05:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 41 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 22:05:11,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:05:12,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:05:12,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-19 22:05:12,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:05:12,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-19 22:05:12,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| Int) (v_ArrVal_2183 Int) (v_arrayElimArr_10 (Array Int Int)) (aux_div_v_ArrVal_2182_40 Int) (v_ArrVal_2176 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) 8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset| 8))) 0 v_ArrVal_2183)) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_ArrVal_2176) |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) 8) 0)) (< (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|) 18446744073709551616) (mod (select v_arrayElimArr_10 0) 18446744073709551616)) (= (mod (select (select (store (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_arrayElimArr_11) |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) 0) 18446744073709551616) 0) (not (= (select v_arrayElimArr_11 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|) (* 18446744073709551616 aux_div_v_ArrVal_2182_40))))) is different from false [2022-07-19 22:05:12,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168216726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:12,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:05:12,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26] total 41 [2022-07-19 22:05:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110073212] [2022-07-19 22:05:12,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:05:12,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-19 22:05:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-19 22:05:12,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2627, Unknown=26, NotChecked=104, Total=2970 [2022-07-19 22:05:12,290 INFO L87 Difference]: Start difference. First operand 454 states and 583 transitions. Second operand has 41 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 16 states have call successors, (23), 5 states have call predecessors, (23), 8 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-19 22:05:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:18,001 INFO L93 Difference]: Finished difference Result 619 states and 793 transitions. [2022-07-19 22:05:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-19 22:05:18,001 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 16 states have call successors, (23), 5 states have call predecessors, (23), 8 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) Word has length 95 [2022-07-19 22:05:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:18,003 INFO L225 Difference]: With dead ends: 619 [2022-07-19 22:05:18,003 INFO L226 Difference]: Without dead ends: 561 [2022-07-19 22:05:18,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 110 SyntacticMatches, 10 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2440 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=771, Invalid=8518, Unknown=27, NotChecked=190, Total=9506 [2022-07-19 22:05:18,007 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 248 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 3860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:18,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1104 Invalid, 3860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2661 Invalid, 0 Unknown, 864 Unchecked, 1.8s Time] [2022-07-19 22:05:18,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-07-19 22:05:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 474. [2022-07-19 22:05:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 303 states have (on average 1.0825082508250825) internal successors, (328), 313 states have internal predecessors, (328), 129 states have call successors, (129), 41 states have call predecessors, (129), 41 states have return successors, (137), 119 states have call predecessors, (137), 123 states have call successors, (137) [2022-07-19 22:05:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 594 transitions. [2022-07-19 22:05:18,117 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 594 transitions. Word has length 95 [2022-07-19 22:05:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:18,117 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 594 transitions. [2022-07-19 22:05:18,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 16 states have call successors, (23), 5 states have call predecessors, (23), 8 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-19 22:05:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 594 transitions. [2022-07-19 22:05:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 22:05:18,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:18,118 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:18,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-19 22:05:18,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-19 22:05:18,319 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1566240838, now seen corresponding path program 1 times [2022-07-19 22:05:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:18,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069682342] [2022-07-19 22:05:18,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:18,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:05:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:05:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:05:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:05:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:05:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:05:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:05:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:05:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 22:05:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:05:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:05:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-19 22:05:18,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:18,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069682342] [2022-07-19 22:05:18,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069682342] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:18,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447798446] [2022-07-19 22:05:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:18,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:18,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:18,908 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-19 22:05:18,918 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-19 22:05:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:19,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 2668 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-19 22:05:19,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:19,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:05:19,542 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-19 22:05:19,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 22:05:20,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2022-07-19 22:05:20,573 INFO L356 Elim1Store]: treesize reduction 65, result has 39.3 percent of original size [2022-07-19 22:05:20,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 64 [2022-07-19 22:05:20,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 22:05:20,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 22:05:20,600 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-19 22:05:20,606 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-19 22:05:20,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-19 22:05:21,933 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:05:21,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2022-07-19 22:05:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 55 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 22:05:21,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:05:22,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:05:22,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-19 22:05:22,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:05:22,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-19 22:05:22,271 WARN L833 $PredicateComparison]: unable to prove that (and (not (< 9223372036854775807 (mod |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2#1| 18446744073709551616))) (forall ((|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| Int) (v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_arrayElimArr_14 (Array Int Int)) (aux_div_v_ArrVal_2301_40 Int)) (or (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|) |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1|)) (not (< 9223372036854775807 (mod (select (select (store (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_13) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset|) 18446744073709551616))) (not (= (* 18446744073709551616 aux_div_v_ArrVal_2301_40) (select v_arrayElimArr_14 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|)))))) is different from false [2022-07-19 22:05:22,291 WARN L833 $PredicateComparison]: unable to prove that (or (and (not (< 9223372036854775807 (mod |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2#1| 18446744073709551616))) (forall ((|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| Int) (v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_arrayElimArr_14 (Array Int Int)) (aux_div_v_ArrVal_2301_40 Int)) (or (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|) |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1|)) (not (< 9223372036854775807 (mod (select (select (store (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_13) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset|) 18446744073709551616))) (not (= (* 18446744073709551616 aux_div_v_ArrVal_2301_40) (select v_arrayElimArr_14 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|)))))) |c_ULTIMATE.start_aws_byte_cursor_advance_#t~short1082#1|) is different from false [2022-07-19 22:05:22,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447798446] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:22,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:05:22,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 38 [2022-07-19 22:05:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168057089] [2022-07-19 22:05:22,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:05:22,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-19 22:05:22,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:22,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-19 22:05:22,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1579, Unknown=2, NotChecked=162, Total=1892 [2022-07-19 22:05:22,397 INFO L87 Difference]: Start difference. First operand 474 states and 594 transitions. Second operand has 38 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 13 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-19 22:05:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:28,141 INFO L93 Difference]: Finished difference Result 600 states and 717 transitions. [2022-07-19 22:05:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-19 22:05:28,141 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 13 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) Word has length 101 [2022-07-19 22:05:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:28,143 INFO L225 Difference]: With dead ends: 600 [2022-07-19 22:05:28,143 INFO L226 Difference]: Without dead ends: 579 [2022-07-19 22:05:28,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 144 SyntacticMatches, 17 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2254 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=561, Invalid=6754, Unknown=3, NotChecked=338, Total=7656 [2022-07-19 22:05:28,145 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 149 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2814 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 3933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 946 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:28,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 824 Invalid, 3933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2814 Invalid, 0 Unknown, 946 Unchecked, 1.9s Time] [2022-07-19 22:05:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-07-19 22:05:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 570. [2022-07-19 22:05:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 375 states have (on average 1.0693333333333332) internal successors, (401), 385 states have internal predecessors, (401), 139 states have call successors, (139), 56 states have call predecessors, (139), 55 states have return successors, (144), 128 states have call predecessors, (144), 130 states have call successors, (144) [2022-07-19 22:05:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 684 transitions. [2022-07-19 22:05:28,291 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 684 transitions. Word has length 101 [2022-07-19 22:05:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:28,292 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 684 transitions. [2022-07-19 22:05:28,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 13 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-19 22:05:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 684 transitions. [2022-07-19 22:05:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 22:05:28,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:28,294 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:28,317 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-19 22:05:28,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:28,500 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:28,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:28,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1636607180, now seen corresponding path program 1 times [2022-07-19 22:05:28,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:28,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055343640] [2022-07-19 22:05:28,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:28,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:05:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:05:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:05:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:05:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:05:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:05:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:05:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:05:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 22:05:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:05:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:05:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-19 22:05:29,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:29,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055343640] [2022-07-19 22:05:29,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055343640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:29,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:29,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-19 22:05:29,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246508244] [2022-07-19 22:05:29,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:29,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 22:05:29,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:29,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 22:05:29,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:05:29,241 INFO L87 Difference]: Start difference. First operand 570 states and 684 transitions. Second operand has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-19 22:05:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:30,321 INFO L93 Difference]: Finished difference Result 576 states and 689 transitions. [2022-07-19 22:05:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 22:05:30,322 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 101 [2022-07-19 22:05:30,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:30,324 INFO L225 Difference]: With dead ends: 576 [2022-07-19 22:05:30,324 INFO L226 Difference]: Without dead ends: 574 [2022-07-19 22:05:30,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-07-19 22:05:30,324 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 63 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:30,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 394 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 22:05:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-07-19 22:05:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2022-07-19 22:05:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 378 states have (on average 1.0687830687830688) internal successors, (404), 388 states have internal predecessors, (404), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (144), 128 states have call predecessors, (144), 130 states have call successors, (144) [2022-07-19 22:05:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 687 transitions. [2022-07-19 22:05:30,473 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 687 transitions. Word has length 101 [2022-07-19 22:05:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:30,474 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 687 transitions. [2022-07-19 22:05:30,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-19 22:05:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 687 transitions. [2022-07-19 22:05:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-19 22:05:30,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:30,476 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:30,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-19 22:05:30,476 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:30,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:30,477 INFO L85 PathProgramCache]: Analyzing trace with hash -326672390, now seen corresponding path program 1 times [2022-07-19 22:05:30,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:30,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298756985] [2022-07-19 22:05:30,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:30,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:05:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:05:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:05:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:05:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:05:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:05:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:05:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:05:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:05:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:05:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-19 22:05:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:32,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298756985] [2022-07-19 22:05:32,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298756985] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:32,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765403467] [2022-07-19 22:05:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:32,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:32,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:32,696 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-19 22:05:32,697 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-19 22:05:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 2666 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-19 22:05:33,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:33,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:05:33,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:05:33,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:05:34,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-07-19 22:05:34,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:05:34,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:34,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:05:34,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:34,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:34,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:05:34,091 INFO L356 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2022-07-19 22:05:34,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 41 [2022-07-19 22:05:34,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:05:34,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:34,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:34,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:34,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:05:34,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:05:34,119 INFO L356 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2022-07-19 22:05:34,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 37 [2022-07-19 22:05:35,021 INFO L356 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2022-07-19 22:05:35,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 16 [2022-07-19 22:05:35,032 INFO L356 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2022-07-19 22:05:35,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2022-07-19 22:05:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 19 proven. 52 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-19 22:05:35,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:05:36,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765403467] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:36,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:05:36,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 49 [2022-07-19 22:05:36,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924195749] [2022-07-19 22:05:36,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:05:36,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-19 22:05:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:36,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-19 22:05:36,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3003, Unknown=0, NotChecked=0, Total=3192 [2022-07-19 22:05:36,352 INFO L87 Difference]: Start difference. First operand 574 states and 687 transitions. Second operand has 49 states, 42 states have (on average 2.0) internal successors, (84), 46 states have internal predecessors, (84), 20 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) [2022-07-19 22:05:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:42,045 INFO L93 Difference]: Finished difference Result 617 states and 739 transitions. [2022-07-19 22:05:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-19 22:05:42,045 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 42 states have (on average 2.0) internal successors, (84), 46 states have internal predecessors, (84), 20 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) Word has length 102 [2022-07-19 22:05:42,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:42,047 INFO L225 Difference]: With dead ends: 617 [2022-07-19 22:05:42,047 INFO L226 Difference]: Without dead ends: 615 [2022-07-19 22:05:42,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 105 SyntacticMatches, 17 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=507, Invalid=6975, Unknown=0, NotChecked=0, Total=7482 [2022-07-19 22:05:42,048 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 206 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 4010 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 5250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 4010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1020 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:42,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 2150 Invalid, 5250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 4010 Invalid, 0 Unknown, 1020 Unchecked, 3.3s Time] [2022-07-19 22:05:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-19 22:05:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 591. [2022-07-19 22:05:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 389 states have (on average 1.0668380462724936) internal successors, (415), 399 states have internal predecessors, (415), 143 states have call successors, (143), 59 states have call predecessors, (143), 58 states have return successors, (148), 132 states have call predecessors, (148), 134 states have call successors, (148) [2022-07-19 22:05:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 706 transitions. [2022-07-19 22:05:42,166 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 706 transitions. Word has length 102 [2022-07-19 22:05:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:42,166 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 706 transitions. [2022-07-19 22:05:42,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 42 states have (on average 2.0) internal successors, (84), 46 states have internal predecessors, (84), 20 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) [2022-07-19 22:05:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 706 transitions. [2022-07-19 22:05:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-19 22:05:42,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:42,168 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:42,192 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-19 22:05:42,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-19 22:05:42,383 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1201612672, now seen corresponding path program 2 times [2022-07-19 22:05:42,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:42,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918984235] [2022-07-19 22:05:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:42,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:05:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:43,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:05:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:43,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:05:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:43,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:05:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:43,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:05:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:43,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:05:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:43,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:05:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:43,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:05:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-19 22:05:43,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:43,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918984235] [2022-07-19 22:05:43,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918984235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:43,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:43,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-19 22:05:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723668841] [2022-07-19 22:05:43,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:43,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 22:05:43,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:43,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 22:05:43,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:05:43,160 INFO L87 Difference]: Start difference. First operand 591 states and 706 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-19 22:05:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:44,931 INFO L93 Difference]: Finished difference Result 658 states and 789 transitions. [2022-07-19 22:05:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 22:05:44,932 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 101 [2022-07-19 22:05:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:44,934 INFO L225 Difference]: With dead ends: 658 [2022-07-19 22:05:44,934 INFO L226 Difference]: Without dead ends: 591 [2022-07-19 22:05:44,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 22:05:44,935 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 96 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:44,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 651 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 22:05:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-19 22:05:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2022-07-19 22:05:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 389 states have (on average 1.0668380462724936) internal successors, (415), 399 states have internal predecessors, (415), 143 states have call successors, (143), 59 states have call predecessors, (143), 58 states have return successors, (146), 132 states have call predecessors, (146), 134 states have call successors, (146) [2022-07-19 22:05:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 704 transitions. [2022-07-19 22:05:45,064 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 704 transitions. Word has length 101 [2022-07-19 22:05:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:45,064 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 704 transitions. [2022-07-19 22:05:45,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-19 22:05:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 704 transitions. [2022-07-19 22:05:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 22:05:45,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:45,066 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:45,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-19 22:05:45,066 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:45,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:45,067 INFO L85 PathProgramCache]: Analyzing trace with hash -808905162, now seen corresponding path program 1 times [2022-07-19 22:05:45,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:45,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111268902] [2022-07-19 22:05:45,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:45,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:05:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:05:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:05:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:05:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:05:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:05:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:05:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:05:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:05:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:05:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-19 22:05:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111268902] [2022-07-19 22:05:45,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111268902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:45,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:45,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:05:45,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471729033] [2022-07-19 22:05:45,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:45,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:05:45,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:45,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:05:45,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:05:45,492 INFO L87 Difference]: Start difference. First operand 591 states and 704 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-19 22:05:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:45,987 INFO L93 Difference]: Finished difference Result 597 states and 709 transitions. [2022-07-19 22:05:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:05:45,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 106 [2022-07-19 22:05:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:45,990 INFO L225 Difference]: With dead ends: 597 [2022-07-19 22:05:45,990 INFO L226 Difference]: Without dead ends: 533 [2022-07-19 22:05:45,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:05:45,991 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 43 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:45,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 750 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:05:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-07-19 22:05:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2022-07-19 22:05:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 359 states have (on average 1.0612813370473537) internal successors, (381), 366 states have internal predecessors, (381), 117 states have call successors, (117), 56 states have call predecessors, (117), 56 states have return successors, (122), 110 states have call predecessors, (122), 110 states have call successors, (122) [2022-07-19 22:05:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 620 transitions. [2022-07-19 22:05:46,122 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 620 transitions. Word has length 106 [2022-07-19 22:05:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:46,123 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 620 transitions. [2022-07-19 22:05:46,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-19 22:05:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 620 transitions. [2022-07-19 22:05:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 22:05:46,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:46,125 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:46,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-19 22:05:46,126 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:46,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:46,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1821091513, now seen corresponding path program 1 times [2022-07-19 22:05:46,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:46,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764899143] [2022-07-19 22:05:46,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:46,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:05:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:05:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:05:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:05:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:05:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:05:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:05:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:05:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-19 22:05:46,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:46,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764899143] [2022-07-19 22:05:46,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764899143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:46,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:46,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:05:46,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515917786] [2022-07-19 22:05:46,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:46,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:05:46,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:46,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:05:46,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:05:46,496 INFO L87 Difference]: Start difference. First operand 533 states and 620 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-19 22:05:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:47,170 INFO L93 Difference]: Finished difference Result 539 states and 625 transitions. [2022-07-19 22:05:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:05:47,170 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2022-07-19 22:05:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:47,172 INFO L225 Difference]: With dead ends: 539 [2022-07-19 22:05:47,172 INFO L226 Difference]: Without dead ends: 537 [2022-07-19 22:05:47,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-19 22:05:47,173 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 57 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:47,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 679 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 22:05:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-07-19 22:05:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-07-19 22:05:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 362 states have (on average 1.0607734806629834) internal successors, (384), 369 states have internal predecessors, (384), 117 states have call successors, (117), 57 states have call predecessors, (117), 57 states have return successors, (122), 110 states have call predecessors, (122), 110 states have call successors, (122) [2022-07-19 22:05:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 623 transitions. [2022-07-19 22:05:47,279 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 623 transitions. Word has length 103 [2022-07-19 22:05:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:47,279 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 623 transitions. [2022-07-19 22:05:47,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-19 22:05:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 623 transitions. [2022-07-19 22:05:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 22:05:47,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:47,281 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:47,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-19 22:05:47,282 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:47,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:47,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1257386079, now seen corresponding path program 1 times [2022-07-19 22:05:47,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:47,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576782312] [2022-07-19 22:05:47,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:05:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:05:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:05:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:05:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:05:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:05:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:05:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:05:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 22:05:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:05:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:05:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 22:05:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-19 22:05:47,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:47,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576782312] [2022-07-19 22:05:47,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576782312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:47,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855131487] [2022-07-19 22:05:47,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:47,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:47,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:47,995 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-19 22:05:47,996 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-19 22:05:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:48,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 2686 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-19 22:05:48,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:48,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, 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-19 22:05:49,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-19 22:05:49,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:05:49,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-07-19 22:05:49,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-19 22:05:49,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-19 22:05:49,419 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:05:49,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 22:05:49,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 22:05:50,599 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 22:05:50,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 18 [2022-07-19 22:05:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 22:05:50,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:05:51,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855131487] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:51,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:05:51,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31] total 45 [2022-07-19 22:05:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845210851] [2022-07-19 22:05:51,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:05:51,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-19 22:05:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:51,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-19 22:05:51,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2285, Unknown=0, NotChecked=0, Total=2450 [2022-07-19 22:05:51,067 INFO L87 Difference]: Start difference. First operand 537 states and 623 transitions. Second operand has 45 states, 40 states have (on average 2.425) internal successors, (97), 39 states have internal predecessors, (97), 16 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-19 22:05:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:55,029 INFO L93 Difference]: Finished difference Result 638 states and 760 transitions. [2022-07-19 22:05:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-07-19 22:05:55,030 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.425) internal successors, (97), 39 states have internal predecessors, (97), 16 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) Word has length 107 [2022-07-19 22:05:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:55,032 INFO L225 Difference]: With dead ends: 638 [2022-07-19 22:05:55,032 INFO L226 Difference]: Without dead ends: 634 [2022-07-19 22:05:55,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 123 SyntacticMatches, 20 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4726 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=844, Invalid=12266, Unknown=0, NotChecked=0, Total=13110 [2022-07-19 22:05:55,033 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 313 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 758 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:55,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 769 Invalid, 3472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2395 Invalid, 0 Unknown, 758 Unchecked, 1.7s Time] [2022-07-19 22:05:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-07-19 22:05:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 554. [2022-07-19 22:05:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 374 states have (on average 1.0561497326203209) internal successors, (395), 380 states have internal predecessors, (395), 120 states have call successors, (120), 60 states have call predecessors, (120), 59 states have return successors, (125), 113 states have call predecessors, (125), 113 states have call successors, (125) [2022-07-19 22:05:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 640 transitions. [2022-07-19 22:05:55,125 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 640 transitions. Word has length 107 [2022-07-19 22:05:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:55,125 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 640 transitions. [2022-07-19 22:05:55,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.425) internal successors, (97), 39 states have internal predecessors, (97), 16 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-19 22:05:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 640 transitions. [2022-07-19 22:05:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 22:05:55,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:55,127 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:55,148 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-19 22:05:55,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:55,328 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:55,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1379697227, now seen corresponding path program 1 times [2022-07-19 22:05:55,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:55,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288719387] [2022-07-19 22:05:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:55,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:05:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:05:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:05:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 22:05:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:05:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:05:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:05:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:05:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:05:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:05:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:05:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:05:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-19 22:05:55,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:55,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288719387] [2022-07-19 22:05:55,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288719387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:55,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:55,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:05:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641670662] [2022-07-19 22:05:55,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:55,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:05:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:05:55,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:05:55,930 INFO L87 Difference]: Start difference. First operand 554 states and 640 transitions. Second operand has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-19 22:05:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:56,544 INFO L93 Difference]: Finished difference Result 560 states and 645 transitions. [2022-07-19 22:05:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:05:56,544 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 108 [2022-07-19 22:05:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:56,546 INFO L225 Difference]: With dead ends: 560 [2022-07-19 22:05:56,546 INFO L226 Difference]: Without dead ends: 486 [2022-07-19 22:05:56,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:05:56,547 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 23 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:56,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 913 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 22:05:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-07-19 22:05:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 484. [2022-07-19 22:05:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 326 states have (on average 1.0582822085889572) internal successors, (345), 331 states have internal predecessors, (345), 107 states have call successors, (107), 52 states have call predecessors, (107), 50 states have return successors, (111), 100 states have call predecessors, (111), 100 states have call successors, (111) [2022-07-19 22:05:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 563 transitions. [2022-07-19 22:05:56,643 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 563 transitions. Word has length 108 [2022-07-19 22:05:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:56,643 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 563 transitions. [2022-07-19 22:05:56,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-19 22:05:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 563 transitions. [2022-07-19 22:05:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 22:05:56,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:56,645 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:56,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-19 22:05:56,645 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:56,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1880590197, now seen corresponding path program 1 times [2022-07-19 22:05:56,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:56,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542240131] [2022-07-19 22:05:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:56,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:05:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 22:05:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 22:05:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:05:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:05:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 22:05:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:05:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:05:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 22:05:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:05:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:05:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-19 22:05:57,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:57,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542240131] [2022-07-19 22:05:57,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542240131] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:57,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781907903] [2022-07-19 22:05:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:57,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:57,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:57,218 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-19 22:05:57,244 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-19 22:05:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:57,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 2688 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-19 22:05:57,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:57,734 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-19 22:05:57,737 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-19 22:05:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-19 22:05:58,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:05:58,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781907903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:58,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:05:58,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-07-19 22:05:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420597034] [2022-07-19 22:05:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:58,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:05:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:58,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:05:58,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:05:58,010 INFO L87 Difference]: Start difference. First operand 484 states and 563 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-19 22:05:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:58,211 INFO L93 Difference]: Finished difference Result 498 states and 575 transitions. [2022-07-19 22:05:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:05:58,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2022-07-19 22:05:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:58,213 INFO L225 Difference]: With dead ends: 498 [2022-07-19 22:05:58,213 INFO L226 Difference]: Without dead ends: 397 [2022-07-19 22:05:58,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:05:58,214 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 38 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:58,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 599 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 93 Unchecked, 0.1s Time] [2022-07-19 22:05:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-19 22:05:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-07-19 22:05:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 262 states have (on average 1.0648854961832062) internal successors, (279), 267 states have internal predecessors, (279), 94 states have call successors, (94), 41 states have call predecessors, (94), 40 states have return successors, (99), 88 states have call predecessors, (99), 88 states have call successors, (99) [2022-07-19 22:05:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 472 transitions. [2022-07-19 22:05:58,317 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 472 transitions. Word has length 108 [2022-07-19 22:05:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:58,317 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 472 transitions. [2022-07-19 22:05:58,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-19 22:05:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 472 transitions. [2022-07-19 22:05:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-19 22:05:58,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:58,319 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:58,352 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-19 22:05:58,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-07-19 22:05:58,543 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:58,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:58,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1767868658, now seen corresponding path program 1 times [2022-07-19 22:05:58,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:58,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152242592] [2022-07-19 22:05:58,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:58,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:05:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:05:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:05:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:05:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:05:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 22:05:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:05:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:05:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:05:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:05:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:05:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:05:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-19 22:05:58,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:58,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152242592] [2022-07-19 22:05:58,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152242592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:58,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230035385] [2022-07-19 22:05:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:58,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:58,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:58,996 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-19 22:05:58,998 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-19 22:05:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:59,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 2712 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-19 22:05:59,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:59,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:05:59,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 22:05:59,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:59,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-19 22:06:00,021 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-19 22:06:00,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-07-19 22:06:00,056 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-19 22:06:02,160 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-19 22:06:04,468 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-19 22:06:04,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2022-07-19 22:06:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 22:06:04,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:06:04,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3024 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3024) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) is different from false [2022-07-19 22:06:04,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230035385] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:06:04,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:06:04,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2022-07-19 22:06:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953735558] [2022-07-19 22:06:04,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:06:04,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-19 22:06:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:06:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-19 22:06:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1003, Unknown=2, NotChecked=64, Total=1190 [2022-07-19 22:06:04,653 INFO L87 Difference]: Start difference. First operand 397 states and 472 transitions. Second operand has 32 states, 30 states have (on average 3.433333333333333) internal successors, (103), 28 states have internal predecessors, (103), 11 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) [2022-07-19 22:06:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:06:07,677 INFO L93 Difference]: Finished difference Result 492 states and 573 transitions. [2022-07-19 22:06:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-19 22:06:07,678 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.433333333333333) internal successors, (103), 28 states have internal predecessors, (103), 11 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) Word has length 114 [2022-07-19 22:06:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:06:07,679 INFO L225 Difference]: With dead ends: 492 [2022-07-19 22:06:07,679 INFO L226 Difference]: Without dead ends: 358 [2022-07-19 22:06:07,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 194 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=277, Invalid=2376, Unknown=3, NotChecked=100, Total=2756 [2022-07-19 22:06:07,680 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 74 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 497 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:06:07,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 521 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 621 Invalid, 0 Unknown, 497 Unchecked, 0.5s Time] [2022-07-19 22:06:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-19 22:06:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2022-07-19 22:06:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 241 states have (on average 1.058091286307054) internal successors, (255), 245 states have internal predecessors, (255), 78 states have call successors, (78), 40 states have call predecessors, (78), 38 states have return successors, (82), 72 states have call predecessors, (82), 72 states have call successors, (82) [2022-07-19 22:06:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 415 transitions. [2022-07-19 22:06:07,737 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 415 transitions. Word has length 114 [2022-07-19 22:06:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:06:07,737 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 415 transitions. [2022-07-19 22:06:07,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.433333333333333) internal successors, (103), 28 states have internal predecessors, (103), 11 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) [2022-07-19 22:06:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 415 transitions. [2022-07-19 22:06:07,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-19 22:06:07,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:06:07,738 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:06:07,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-07-19 22:06:07,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-19 22:06:07,951 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:06:07,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:06:07,952 INFO L85 PathProgramCache]: Analyzing trace with hash -329161806, now seen corresponding path program 1 times [2022-07-19 22:06:07,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:06:07,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494379266] [2022-07-19 22:06:07,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:06:07,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:06:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:06:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:06:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:06:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:06:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:06:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:06:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:06:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:06:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:06:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:06:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 22:06:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:06:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:06:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 22:06:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 22:06:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-19 22:06:08,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:06:08,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494379266] [2022-07-19 22:06:08,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494379266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:06:08,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:06:08,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-19 22:06:08,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278502313] [2022-07-19 22:06:08,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:06:08,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 22:06:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:06:08,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 22:06:08,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:06:08,666 INFO L87 Difference]: Start difference. First operand 358 states and 415 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-19 22:06:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:06:10,328 INFO L93 Difference]: Finished difference Result 379 states and 439 transitions. [2022-07-19 22:06:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 22:06:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 117 [2022-07-19 22:06:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:06:10,330 INFO L225 Difference]: With dead ends: 379 [2022-07-19 22:06:10,330 INFO L226 Difference]: Without dead ends: 365 [2022-07-19 22:06:10,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2022-07-19 22:06:10,331 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:06:10,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 394 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 22:06:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-19 22:06:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2022-07-19 22:06:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 241 states have (on average 1.053941908713693) internal successors, (254), 245 states have internal predecessors, (254), 78 states have call successors, (78), 40 states have call predecessors, (78), 38 states have return successors, (82), 72 states have call predecessors, (82), 72 states have call successors, (82) [2022-07-19 22:06:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 414 transitions. [2022-07-19 22:06:10,414 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 414 transitions. Word has length 117 [2022-07-19 22:06:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:06:10,415 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 414 transitions. [2022-07-19 22:06:10,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-19 22:06:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 414 transitions. [2022-07-19 22:06:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-19 22:06:10,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:06:10,416 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:06:10,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-19 22:06:10,416 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:06:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:06:10,416 INFO L85 PathProgramCache]: Analyzing trace with hash -110307088, now seen corresponding path program 1 times [2022-07-19 22:06:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:06:10,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750224708] [2022-07-19 22:06:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:06:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:06:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:06:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:06:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:06:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:06:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:06:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:06:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:06:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:06:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:06:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:06:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 22:06:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:06:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:06:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 22:06:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 22:06:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-19 22:06:10,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:06:10,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750224708] [2022-07-19 22:06:10,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750224708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:06:10,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:06:10,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:06:10,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735766200] [2022-07-19 22:06:10,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:06:10,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:06:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:06:10,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:06:10,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:06:10,936 INFO L87 Difference]: Start difference. First operand 358 states and 414 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-19 22:06:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:06:12,036 INFO L93 Difference]: Finished difference Result 362 states and 417 transitions. [2022-07-19 22:06:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:06:12,036 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 117 [2022-07-19 22:06:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:06:12,038 INFO L225 Difference]: With dead ends: 362 [2022-07-19 22:06:12,038 INFO L226 Difference]: Without dead ends: 298 [2022-07-19 22:06:12,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-07-19 22:06:12,039 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 90 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:06:12,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 385 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 22:06:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-19 22:06:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-07-19 22:06:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 203 states have (on average 1.0541871921182266) internal successors, (214), 206 states have internal predecessors, (214), 62 states have call successors, (62), 33 states have call predecessors, (62), 32 states have return successors, (68), 58 states have call predecessors, (68), 58 states have call successors, (68) [2022-07-19 22:06:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 344 transitions. [2022-07-19 22:06:12,104 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 344 transitions. Word has length 117 [2022-07-19 22:06:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:06:12,104 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 344 transitions. [2022-07-19 22:06:12,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-19 22:06:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 344 transitions. [2022-07-19 22:06:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-19 22:06:12,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:06:12,106 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:06:12,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-19 22:06:12,106 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:06:12,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:06:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1577419131, now seen corresponding path program 1 times [2022-07-19 22:06:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:06:12,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170648079] [2022-07-19 22:06:12,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:06:12,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:06:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:06:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:06:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:06:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:06:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:06:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:06:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:06:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:06:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:06:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:06:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 22:06:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:06:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:06:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 22:06:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 22:06:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 22:06:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-07-19 22:06:12,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:06:12,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170648079] [2022-07-19 22:06:12,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170648079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:06:12,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:06:12,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 22:06:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958852099] [2022-07-19 22:06:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:06:12,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 22:06:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:06:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 22:06:12,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:06:12,870 INFO L87 Difference]: Start difference. First operand 298 states and 344 transitions. Second operand has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-19 22:06:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:06:13,764 INFO L93 Difference]: Finished difference Result 300 states and 345 transitions. [2022-07-19 22:06:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:06:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 119 [2022-07-19 22:06:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:06:13,766 INFO L225 Difference]: With dead ends: 300 [2022-07-19 22:06:13,766 INFO L226 Difference]: Without dead ends: 204 [2022-07-19 22:06:13,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-07-19 22:06:13,768 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:06:13,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 276 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 22:06:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-19 22:06:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-07-19 22:06:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 135 states have (on average 1.0740740740740742) internal successors, (145), 138 states have internal predecessors, (145), 49 states have call successors, (49), 20 states have call predecessors, (49), 19 states have return successors, (55), 45 states have call predecessors, (55), 46 states have call successors, (55) [2022-07-19 22:06:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 249 transitions. [2022-07-19 22:06:13,810 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 249 transitions. Word has length 119 [2022-07-19 22:06:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:06:13,810 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 249 transitions. [2022-07-19 22:06:13,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-19 22:06:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 249 transitions. [2022-07-19 22:06:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 22:06:13,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:06:13,812 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:06:13,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-19 22:06:13,812 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:06:13,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:06:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash -362342817, now seen corresponding path program 2 times [2022-07-19 22:06:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:06:13,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531125821] [2022-07-19 22:06:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:06:13,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:06:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:06:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:06:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:06:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:06:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:06:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:06:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:06:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:06:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:06:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:06:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:06:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:06:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:06:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:06:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 22:06:14,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:06:14,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531125821] [2022-07-19 22:06:14,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531125821] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:06:14,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797653006] [2022-07-19 22:06:14,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:06:14,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:06:14,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:06:14,268 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-19 22:06:14,270 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-19 22:06:15,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 22:06:15,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:06:15,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 2734 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-19 22:06:15,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:06:15,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:06:15,154 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:06:15,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:06:15,241 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-19 22:06:15,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-07-19 22:06:15,296 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:06:15,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:06:17,591 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:06:17,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 22:06:17,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-19 22:06:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 22:06:21,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:06:22,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3267 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_3267) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) is different from false [2022-07-19 22:06:22,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797653006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:06:22,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:06:22,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 33 [2022-07-19 22:06:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337378658] [2022-07-19 22:06:22,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:06:22,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 22:06:22,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:06:22,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 22:06:22,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=4, NotChecked=78, Total=1722 [2022-07-19 22:06:22,364 INFO L87 Difference]: Start difference. First operand 204 states and 249 transitions. Second operand has 33 states, 30 states have (on average 4.1) internal successors, (123), 29 states have internal predecessors, (123), 10 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) [2022-07-19 22:06:27,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:06:27,540 INFO L93 Difference]: Finished difference Result 350 states and 424 transitions. [2022-07-19 22:06:27,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 22:06:27,540 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 4.1) internal successors, (123), 29 states have internal predecessors, (123), 10 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) Word has length 120 [2022-07-19 22:06:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:06:27,541 INFO L225 Difference]: With dead ends: 350 [2022-07-19 22:06:27,541 INFO L226 Difference]: Without dead ends: 266 [2022-07-19 22:06:27,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 169 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=305, Invalid=2773, Unknown=6, NotChecked=108, Total=3192 [2022-07-19 22:06:27,543 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 216 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 727 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:06:27,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 460 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 983 Invalid, 0 Unknown, 727 Unchecked, 0.7s Time] [2022-07-19 22:06:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-19 22:06:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 216. [2022-07-19 22:06:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 147 states have (on average 1.0680272108843538) internal successors, (157), 150 states have internal predecessors, (157), 48 states have call successors, (48), 21 states have call predecessors, (48), 20 states have return successors, (53), 44 states have call predecessors, (53), 45 states have call successors, (53) [2022-07-19 22:06:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2022-07-19 22:06:27,583 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 120 [2022-07-19 22:06:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:06:27,583 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2022-07-19 22:06:27,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 4.1) internal successors, (123), 29 states have internal predecessors, (123), 10 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) [2022-07-19 22:06:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2022-07-19 22:06:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 22:06:27,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:06:27,584 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:06:27,607 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-19 22:06:27,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-19 22:06:27,785 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:06:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:06:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash -913789417, now seen corresponding path program 1 times [2022-07-19 22:06:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:06:27,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588185725] [2022-07-19 22:06:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:06:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:06:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:06:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:06:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:06:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:06:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:06:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:06:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:06:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:06:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:06:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:06:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:06:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:06:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:06:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:06:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 22:06:28,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:06:28,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588185725] [2022-07-19 22:06:28,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588185725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:06:28,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:06:28,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 22:06:28,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312238177] [2022-07-19 22:06:28,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:06:28,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:06:28,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:06:28,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:06:28,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:06:28,368 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 8 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-19 22:06:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:06:29,307 INFO L93 Difference]: Finished difference Result 268 states and 324 transitions. [2022-07-19 22:06:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:06:29,308 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 8 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 120 [2022-07-19 22:06:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:06:29,309 INFO L225 Difference]: With dead ends: 268 [2022-07-19 22:06:29,309 INFO L226 Difference]: Without dead ends: 240 [2022-07-19 22:06:29,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:06:29,310 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:06:29,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 307 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 22:06:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-19 22:06:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 226. [2022-07-19 22:06:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 151 states have (on average 1.0596026490066226) internal successors, (160), 154 states have internal predecessors, (160), 54 states have call successors, (54), 21 states have call predecessors, (54), 20 states have return successors, (59), 50 states have call predecessors, (59), 51 states have call successors, (59) [2022-07-19 22:06:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 273 transitions. [2022-07-19 22:06:29,360 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 273 transitions. Word has length 120 [2022-07-19 22:06:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:06:29,360 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 273 transitions. [2022-07-19 22:06:29,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 8 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-19 22:06:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 273 transitions. [2022-07-19 22:06:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 22:06:29,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:06:29,361 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:06:29,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-19 22:06:29,362 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:06:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:06:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash -843423075, now seen corresponding path program 1 times [2022-07-19 22:06:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:06:29,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074319768] [2022-07-19 22:06:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:06:29,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:06:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:29,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:06:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:06:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:29,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:06:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:29,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:06:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:29,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:06:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:29,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 22:06:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:29,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:06:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:06:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:06:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:30,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:06:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:30,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:06:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:30,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:06:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:30,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:06:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:06:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 22:06:30,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:06:30,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074319768] [2022-07-19 22:06:30,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074319768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:06:30,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487760537] [2022-07-19 22:06:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:06:30,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:06:30,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:06:30,111 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-19 22:06:30,112 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-19 22:06:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:06:30,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 2764 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-19 22:06:30,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:06:30,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:06:30,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 22:06:30,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:06:30,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-19 22:06:30,885 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-19 22:06:30,887 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-19 22:06:33,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:06:33,711 INFO L356 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-07-19 22:06:33,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 53 [2022-07-19 22:06:33,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-19 22:06:33,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-19 22:06:36,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-19 22:06:36,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-19 22:06:36,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:06:36,209 INFO L356 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-07-19 22:06:36,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2022-07-19 22:06:38,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:06:38,586 INFO L356 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2022-07-19 22:06:38,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 32 [2022-07-19 22:06:38,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:06:38,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:06:38,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-19 22:06:38,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:06:38,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:06:38,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-19 22:06:38,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2022-07-19 22:06:38,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 22:06:38,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2022-07-19 22:06:38,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 22:06:39,707 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 8)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22|) 8)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|)))) is different from true [2022-07-19 22:06:45,776 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23|) 8)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23|) 8)))) is different from true [2022-07-19 22:06:52,023 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24|) 8)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26|)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26|) 8)))) is different from true [2022-07-19 22:06:54,140 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25|) 8)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27|)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27|) 8)))) is different from true [2022-07-19 22:06:56,410 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8)) (.cse1 (+ |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_19| 8)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26|) 8) .cse0) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21|) .cse1) .cse0) (= .cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21|) .cse1)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|)) (= .cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26|) 8))))) is different from true [2022-07-19 22:06:58,600 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8)) (.cse1 (+ |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_20| 8)) (.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27|) 8)) (= .cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22|) .cse1)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22|) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27|) 8) .cse2) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22|)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|))))) is different from true [2022-07-19 22:06:58,779 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-19 22:06:58,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-07-19 22:06:58,784 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-19 22:06:58,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-07-19 22:06:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 72 not checked. [2022-07-19 22:06:59,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:07:02,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487760537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:07:02,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:07:02,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33] total 49 [2022-07-19 22:07:02,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047389348] [2022-07-19 22:07:02,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:07:02,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-19 22:07:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:07:02,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-19 22:07:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2127, Unknown=9, NotChecked=582, Total=2862 [2022-07-19 22:07:02,184 INFO L87 Difference]: Start difference. First operand 226 states and 273 transitions. Second operand has 49 states, 44 states have (on average 3.340909090909091) internal successors, (147), 44 states have internal predecessors, (147), 17 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (27), 14 states have call predecessors, (27), 16 states have call successors, (27)