./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_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_buf_from_array_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 bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:58:32,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:58:32,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:58:32,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:58:32,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:58:32,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:58:32,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:58:32,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:58:32,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:58:32,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:58:32,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:58:32,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:58:32,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:58:32,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:58:32,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:58:32,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:58:32,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:58:32,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:58:32,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:58:32,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:58:32,857 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:58:32,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:58:32,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:58:32,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:58:32,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:58:32,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:58:32,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:58:32,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:58:32,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:58:32,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:58:32,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:58:32,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:58:32,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:58:32,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:58:32,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:58:32,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:58:32,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:58:32,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:58:32,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:58:32,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:58:32,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:58:32,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:58:32,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 21:58:32,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:58:32,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:58:32,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:58:32,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:58:32,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:58:32,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:58:32,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:58:32,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:58:32,910 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:58:32,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:58:32,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:58:32,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:58:32,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:58:32,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:58:32,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:58:32,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:58:32,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:58:32,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:58:32,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:58:32,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:58:32,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:58:32,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:58:32,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:58:32,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:58:32,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:58:32,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:58:32,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:58:32,916 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:58:32,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:58:32,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:58:32,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 -> bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c [2022-07-19 21:58:33,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:58:33,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:58:33,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:58:33,123 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:58:33,123 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:58:33,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2022-07-19 21:58:33,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9556f2d/0e3cf544021746a298503bffcc071b83/FLAG1109efd0c [2022-07-19 21:58:33,743 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:58:33,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2022-07-19 21:58:33,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9556f2d/0e3cf544021746a298503bffcc071b83/FLAG1109efd0c [2022-07-19 21:58:34,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9556f2d/0e3cf544021746a298503bffcc071b83 [2022-07-19 21:58:34,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:58:34,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:58:34,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:58:34,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:58:34,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:58:34,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:58:34" (1/1) ... [2022-07-19 21:58:34,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36169cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:34, skipping insertion in model container [2022-07-19 21:58:34,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:58:34" (1/1) ... [2022-07-19 21:58:34,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:58:34,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:58:34,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2022-07-19 21:58:34,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2022-07-19 21:58:34,978 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:34,980 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:34,981 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:34,981 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:34,983 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:34,993 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:34,993 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:34,994 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:34,995 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,203 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:58:35,204 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:58:35,205 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:58:35,206 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:58:35,209 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:58:35,212 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:58:35,213 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:58:35,213 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:58:35,215 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:58:35,216 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:58:35,326 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:58:35,450 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,454 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:58:35,561 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:58:35,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2022-07-19 21:58:35,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2022-07-19 21:58:35,606 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,606 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,607 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,607 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,610 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,617 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,619 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,620 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,620 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,658 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:58:35,658 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:58:35,659 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:58:35,659 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:58:35,660 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:58:35,660 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:58:35,661 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:58:35,661 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:58:35,661 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:58:35,661 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:58:35,680 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:58:35,751 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,752 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:35,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:58:35,959 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:58:35,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35 WrapperNode [2022-07-19 21:58:35,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:58:35,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:58:35,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:58:35,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:58:35,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (1/1) ... [2022-07-19 21:58:36,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (1/1) ... [2022-07-19 21:58:36,099 INFO L137 Inliner]: procedures = 690, calls = 2615, calls flagged for inlining = 57, calls inlined = 4, statements flattened = 766 [2022-07-19 21:58:36,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:58:36,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:58:36,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:58:36,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:58:36,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (1/1) ... [2022-07-19 21:58:36,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (1/1) ... [2022-07-19 21:58:36,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (1/1) ... [2022-07-19 21:58:36,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (1/1) ... [2022-07-19 21:58:36,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (1/1) ... [2022-07-19 21:58:36,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (1/1) ... [2022-07-19 21:58:36,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (1/1) ... [2022-07-19 21:58:36,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:58:36,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:58:36,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:58:36,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:58:36,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (1/1) ... [2022-07-19 21:58:36,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:58:36,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:36,226 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 21:58:36,256 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 21:58:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-19 21:58:36,279 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-19 21:58:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:58:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:58:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 21:58:36,280 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 21:58:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 21:58:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:58:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 21:58:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:58:36,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:58:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 21:58:36,282 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 21:58:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 21:58:36,282 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 21:58:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:58:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 21:58:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 21:58:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 21:58:36,283 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 21:58:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:58:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:58:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_from_array [2022-07-19 21:58:36,283 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_from_array [2022-07-19 21:58:36,498 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:58:36,499 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:58:37,300 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:58:37,305 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:58:37,306 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 21:58:37,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:58:37 BoogieIcfgContainer [2022-07-19 21:58:37,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:58:37,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:58:37,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:58:37,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:58:37,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:58:34" (1/3) ... [2022-07-19 21:58:37,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb4f86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:58:37, skipping insertion in model container [2022-07-19 21:58:37,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:35" (2/3) ... [2022-07-19 21:58:37,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb4f86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:58:37, skipping insertion in model container [2022-07-19 21:58:37,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:58:37" (3/3) ... [2022-07-19 21:58:37,314 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2022-07-19 21:58:37,325 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:58:37,325 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:58:37,375 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:58:37,383 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@7c9c2e17, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60c137fa [2022-07-19 21:58:37,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 21:58:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-19 21:58:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 21:58:37,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:37,396 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:37,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash -537066619, now seen corresponding path program 1 times [2022-07-19 21:58:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:37,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109955395] [2022-07-19 21:58:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:37,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:37,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109955395] [2022-07-19 21:58:37,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109955395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:37,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:37,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:58:37,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837300169] [2022-07-19 21:58:37,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:37,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:58:37,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:37,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:58:37,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:58:37,926 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 53 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:38,059 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2022-07-19 21:58:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:58:38,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-07-19 21:58:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:38,076 INFO L225 Difference]: With dead ends: 145 [2022-07-19 21:58:38,076 INFO L226 Difference]: Without dead ends: 68 [2022-07-19 21:58:38,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 21:58:38,087 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:38,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:58:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-19 21:58:38,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-19 21:58:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-19 21:58:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2022-07-19 21:58:38,128 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 33 [2022-07-19 21:58:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:38,128 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2022-07-19 21:58:38,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2022-07-19 21:58:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 21:58:38,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:38,132 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:38,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:58:38,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:38,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash 365093061, now seen corresponding path program 1 times [2022-07-19 21:58:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:38,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953233263] [2022-07-19 21:58:38,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:38,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:38,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:38,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953233263] [2022-07-19 21:58:38,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953233263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:38,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:38,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:58:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249273277] [2022-07-19 21:58:38,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:38,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:58:38,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:38,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:58:38,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:58:38,333 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:38,511 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2022-07-19 21:58:38,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:58:38,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-07-19 21:58:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:38,514 INFO L225 Difference]: With dead ends: 123 [2022-07-19 21:58:38,514 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 21:58:38,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:58:38,516 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:38,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 156 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:58:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 21:58:38,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-19 21:58:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1875) internal successors, (57), 50 states have internal predecessors, (57), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-07-19 21:58:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2022-07-19 21:58:38,525 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 33 [2022-07-19 21:58:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:38,525 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2022-07-19 21:58:38,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-07-19 21:58:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 21:58:38,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:38,526 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:38,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:58:38,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:38,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1309209872, now seen corresponding path program 1 times [2022-07-19 21:58:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:38,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853306616] [2022-07-19 21:58:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:38,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:38,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:38,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:38,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853306616] [2022-07-19 21:58:38,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853306616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:38,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:38,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:58:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715430315] [2022-07-19 21:58:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:38,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:58:38,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:38,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:58:38,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:58:38,802 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 21:58:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:39,091 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2022-07-19 21:58:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:58:39,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-07-19 21:58:39,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:39,092 INFO L225 Difference]: With dead ends: 83 [2022-07-19 21:58:39,092 INFO L226 Difference]: Without dead ends: 81 [2022-07-19 21:58:39,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:58:39,093 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 60 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:39,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 305 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:58:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-19 21:58:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-07-19 21:58:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 57 states have internal predecessors, (63), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-07-19 21:58:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2022-07-19 21:58:39,099 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 39 [2022-07-19 21:58:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:39,099 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2022-07-19 21:58:39,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 21:58:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2022-07-19 21:58:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 21:58:39,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:39,107 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:39,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:58:39,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash -853000232, now seen corresponding path program 1 times [2022-07-19 21:58:39,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:39,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605453420] [2022-07-19 21:58:39,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:39,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:39,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:39,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:39,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:39,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605453420] [2022-07-19 21:58:39,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605453420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:39,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:39,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:58:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752054372] [2022-07-19 21:58:39,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:39,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:58:39,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:39,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:58:39,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:58:39,378 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 21:58:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:39,691 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2022-07-19 21:58:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:58:39,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-19 21:58:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:39,693 INFO L225 Difference]: With dead ends: 164 [2022-07-19 21:58:39,693 INFO L226 Difference]: Without dead ends: 105 [2022-07-19 21:58:39,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:58:39,694 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 100 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:39,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 188 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:58:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-19 21:58:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2022-07-19 21:58:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 62 states have internal predecessors, (70), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-07-19 21:58:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2022-07-19 21:58:39,708 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 43 [2022-07-19 21:58:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:39,708 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2022-07-19 21:58:39,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 21:58:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-07-19 21:58:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 21:58:39,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:39,709 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:39,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:58:39,709 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash -594834794, now seen corresponding path program 1 times [2022-07-19 21:58:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:39,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177274447] [2022-07-19 21:58:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:39,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:39,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:39,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:39,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:40,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:40,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177274447] [2022-07-19 21:58:40,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177274447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:40,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:40,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:58:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703820875] [2022-07-19 21:58:40,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:40,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:58:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:40,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:58:40,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:58:40,046 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:40,442 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2022-07-19 21:58:40,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:58:40,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-19 21:58:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:40,443 INFO L225 Difference]: With dead ends: 180 [2022-07-19 21:58:40,443 INFO L226 Difference]: Without dead ends: 111 [2022-07-19 21:58:40,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:58:40,444 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:40,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 235 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:58:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-19 21:58:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-07-19 21:58:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 83 states have internal predecessors, (93), 17 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-07-19 21:58:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2022-07-19 21:58:40,463 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 43 [2022-07-19 21:58:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:40,463 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2022-07-19 21:58:40,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2022-07-19 21:58:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 21:58:40,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:40,466 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:40,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:58:40,466 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:40,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1874698472, now seen corresponding path program 1 times [2022-07-19 21:58:40,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:40,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065408658] [2022-07-19 21:58:40,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:40,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:40,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:40,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:40,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:40,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065408658] [2022-07-19 21:58:40,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065408658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:40,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:40,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:58:40,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128993923] [2022-07-19 21:58:40,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:40,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:58:40,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:58:40,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:58:40,930 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:41,261 INFO L93 Difference]: Finished difference Result 223 states and 282 transitions. [2022-07-19 21:58:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:58:41,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-19 21:58:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:41,263 INFO L225 Difference]: With dead ends: 223 [2022-07-19 21:58:41,263 INFO L226 Difference]: Without dead ends: 135 [2022-07-19 21:58:41,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:58:41,264 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 146 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:41,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 241 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:58:41,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-19 21:58:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 103. [2022-07-19 21:58:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 80 states have internal predecessors, (89), 17 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-07-19 21:58:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2022-07-19 21:58:41,274 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 43 [2022-07-19 21:58:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:41,274 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2022-07-19 21:58:41,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2022-07-19 21:58:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 21:58:41,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:41,278 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:41,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:58:41,278 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:41,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash 573755484, now seen corresponding path program 1 times [2022-07-19 21:58:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:41,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122866683] [2022-07-19 21:58:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:58:41,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:41,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122866683] [2022-07-19 21:58:41,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122866683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:41,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85311214] [2022-07-19 21:58:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:41,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:41,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:41,838 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 21:58:41,861 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 21:58:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:42,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 2427 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-19 21:58:42,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:42,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:42,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:42,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:42,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-19 21:58:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:42,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:42,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85311214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:42,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:42,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2022-07-19 21:58:42,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263078882] [2022-07-19 21:58:42,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:42,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:58:42,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:42,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:58:42,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-07-19 21:58:42,682 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:42,741 INFO L93 Difference]: Finished difference Result 243 states and 303 transitions. [2022-07-19 21:58:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:58:42,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-19 21:58:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:42,743 INFO L225 Difference]: With dead ends: 243 [2022-07-19 21:58:42,744 INFO L226 Difference]: Without dead ends: 150 [2022-07-19 21:58:42,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-07-19 21:58:42,745 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 27 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:42,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 542 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 120 Unchecked, 0.0s Time] [2022-07-19 21:58:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-19 21:58:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2022-07-19 21:58:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 117 states have internal predecessors, (134), 17 states have call successors, (17), 8 states have call predecessors, (17), 14 states have return successors, (27), 15 states have call predecessors, (27), 16 states have call successors, (27) [2022-07-19 21:58:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2022-07-19 21:58:42,757 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 43 [2022-07-19 21:58:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:42,758 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2022-07-19 21:58:42,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2022-07-19 21:58:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 21:58:42,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:42,763 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:42,786 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 21:58:42,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:42,980 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:42,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash 831920922, now seen corresponding path program 1 times [2022-07-19 21:58:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:42,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286648496] [2022-07-19 21:58:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:43,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:43,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:43,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:43,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:43,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:43,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286648496] [2022-07-19 21:58:43,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286648496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:43,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:43,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:58:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268621897] [2022-07-19 21:58:43,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:43,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:58:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:58:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:58:43,166 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 21:58:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:43,361 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2022-07-19 21:58:43,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:58:43,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-19 21:58:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:43,362 INFO L225 Difference]: With dead ends: 234 [2022-07-19 21:58:43,362 INFO L226 Difference]: Without dead ends: 139 [2022-07-19 21:58:43,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:58:43,363 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 63 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:43,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 174 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:58:43,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-19 21:58:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2022-07-19 21:58:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 99 states have internal predecessors, (110), 17 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-07-19 21:58:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2022-07-19 21:58:43,369 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 151 transitions. Word has length 43 [2022-07-19 21:58:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:43,369 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 151 transitions. [2022-07-19 21:58:43,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 21:58:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2022-07-19 21:58:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 21:58:43,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:43,370 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:43,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:58:43,370 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:43,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash -375980076, now seen corresponding path program 1 times [2022-07-19 21:58:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:43,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062972551] [2022-07-19 21:58:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:43,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:43,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:43,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:43,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:43,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062972551] [2022-07-19 21:58:43,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062972551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:43,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:43,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:58:43,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816002909] [2022-07-19 21:58:43,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:43,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:58:43,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:43,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:58:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:58:43,667 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:44,110 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2022-07-19 21:58:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:58:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-19 21:58:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:44,112 INFO L225 Difference]: With dead ends: 220 [2022-07-19 21:58:44,112 INFO L226 Difference]: Without dead ends: 140 [2022-07-19 21:58:44,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:58:44,113 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 124 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:44,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 261 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:58:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-19 21:58:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2022-07-19 21:58:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 104 states have internal predecessors, (117), 17 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2022-07-19 21:58:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2022-07-19 21:58:44,118 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 43 [2022-07-19 21:58:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:44,119 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2022-07-19 21:58:44,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-07-19 21:58:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 21:58:44,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:44,120 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:44,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:58:44,120 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1655843754, now seen corresponding path program 1 times [2022-07-19 21:58:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:44,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468012514] [2022-07-19 21:58:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:44,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:44,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:44,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:44,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:44,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:44,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468012514] [2022-07-19 21:58:44,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468012514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:44,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:44,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:58:44,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781204031] [2022-07-19 21:58:44,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:44,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:58:44,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:44,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:58:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:58:44,383 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:44,786 INFO L93 Difference]: Finished difference Result 234 states and 288 transitions. [2022-07-19 21:58:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:58:44,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-19 21:58:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:44,787 INFO L225 Difference]: With dead ends: 234 [2022-07-19 21:58:44,788 INFO L226 Difference]: Without dead ends: 144 [2022-07-19 21:58:44,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:58:44,788 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 131 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:44,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 217 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:58:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-19 21:58:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2022-07-19 21:58:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 94 states have internal predecessors, (106), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (22), 15 states have call predecessors, (22), 16 states have call successors, (22) [2022-07-19 21:58:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2022-07-19 21:58:44,797 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 43 [2022-07-19 21:58:44,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:44,797 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2022-07-19 21:58:44,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2022-07-19 21:58:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 21:58:44,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:44,799 INFO L195 NwaCegarLoop]: trace histogram [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 21:58:44,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 21:58:44,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2043381215, now seen corresponding path program 1 times [2022-07-19 21:58:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:44,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745133377] [2022-07-19 21:58:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:44,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:44,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:44,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:44,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:44,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:44,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745133377] [2022-07-19 21:58:44,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745133377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:44,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:44,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:58:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312266559] [2022-07-19 21:58:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:44,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:58:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:58:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:58:44,998 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 21:58:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:45,301 INFO L93 Difference]: Finished difference Result 140 states and 169 transitions. [2022-07-19 21:58:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:58:45,301 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-07-19 21:58:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:45,302 INFO L225 Difference]: With dead ends: 140 [2022-07-19 21:58:45,303 INFO L226 Difference]: Without dead ends: 138 [2022-07-19 21:58:45,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:58:45,303 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 65 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:45,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 374 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:58:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-19 21:58:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2022-07-19 21:58:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 100 states have internal predecessors, (111), 17 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (25), 15 states have call predecessors, (25), 16 states have call successors, (25) [2022-07-19 21:58:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2022-07-19 21:58:45,309 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 45 [2022-07-19 21:58:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:45,309 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2022-07-19 21:58:45,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 21:58:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2022-07-19 21:58:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 21:58:45,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:45,309 INFO L195 NwaCegarLoop]: trace histogram [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 21:58:45,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 21:58:45,309 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:45,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1342316637, now seen corresponding path program 1 times [2022-07-19 21:58:45,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:45,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093431578] [2022-07-19 21:58:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:45,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:45,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:45,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:45,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093431578] [2022-07-19 21:58:45,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093431578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:45,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:45,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-19 21:58:45,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778946357] [2022-07-19 21:58:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:45,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 21:58:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:45,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 21:58:45,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:58:45,730 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 21:58:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:46,593 INFO L93 Difference]: Finished difference Result 149 states and 178 transitions. [2022-07-19 21:58:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 21:58:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2022-07-19 21:58:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:46,595 INFO L225 Difference]: With dead ends: 149 [2022-07-19 21:58:46,595 INFO L226 Difference]: Without dead ends: 147 [2022-07-19 21:58:46,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2022-07-19 21:58:46,596 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 91 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:46,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 478 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 21:58:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-19 21:58:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2022-07-19 21:58:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 100 states have internal predecessors, (111), 17 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (25), 15 states have call predecessors, (25), 16 states have call successors, (25) [2022-07-19 21:58:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2022-07-19 21:58:46,604 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 45 [2022-07-19 21:58:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:46,604 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2022-07-19 21:58:46,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 21:58:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2022-07-19 21:58:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 21:58:46,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:46,605 INFO L195 NwaCegarLoop]: trace histogram [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 21:58:46,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 21:58:46,605 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1476330143, now seen corresponding path program 1 times [2022-07-19 21:58:46,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:46,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795343507] [2022-07-19 21:58:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:46,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:46,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 21:58:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:46,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 21:58:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:46,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:46,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795343507] [2022-07-19 21:58:46,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795343507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:46,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:46,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:58:46,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105232980] [2022-07-19 21:58:46,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:46,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:58:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:58:46,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:58:46,831 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:47,137 INFO L93 Difference]: Finished difference Result 217 states and 263 transitions. [2022-07-19 21:58:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:58:47,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-07-19 21:58:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:47,139 INFO L225 Difference]: With dead ends: 217 [2022-07-19 21:58:47,139 INFO L226 Difference]: Without dead ends: 136 [2022-07-19 21:58:47,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:58:47,140 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 55 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:47,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 227 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:58:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-19 21:58:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. [2022-07-19 21:58:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 100 states have internal predecessors, (111), 16 states have call successors, (16), 8 states have call predecessors, (16), 12 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-19 21:58:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2022-07-19 21:58:47,146 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 45 [2022-07-19 21:58:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:47,146 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2022-07-19 21:58:47,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 21:58:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2022-07-19 21:58:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 21:58:47,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:47,147 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:47,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 21:58:47,147 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:47,147 INFO L85 PathProgramCache]: Analyzing trace with hash 316076503, now seen corresponding path program 1 times [2022-07-19 21:58:47,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:47,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232837809] [2022-07-19 21:58:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:47,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:58:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:58:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 21:58:47,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:47,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232837809] [2022-07-19 21:58:47,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232837809] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:47,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937304772] [2022-07-19 21:58:47,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:47,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:47,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:47,276 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 21:58:47,287 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 21:58:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 2481 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:58:47,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:58:47,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:47,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937304772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:47,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:47,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-19 21:58:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383807585] [2022-07-19 21:58:47,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:47,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:58:47,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:47,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:58:47,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:58:47,657 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 21:58:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:47,673 INFO L93 Difference]: Finished difference Result 216 states and 262 transitions. [2022-07-19 21:58:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:58:47,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2022-07-19 21:58:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:47,675 INFO L225 Difference]: With dead ends: 216 [2022-07-19 21:58:47,675 INFO L226 Difference]: Without dead ends: 127 [2022-07-19 21:58:47,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:58:47,676 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 21 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:47,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 243 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:58:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-19 21:58:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2022-07-19 21:58:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.1538461538461537) internal successors, (105), 96 states have internal predecessors, (105), 16 states have call successors, (16), 8 states have call predecessors, (16), 11 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2022-07-19 21:58:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2022-07-19 21:58:47,698 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 54 [2022-07-19 21:58:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:47,698 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2022-07-19 21:58:47,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 21:58:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2022-07-19 21:58:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 21:58:47,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:47,699 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 21:58:47,731 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 21:58:47,899 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,SelfDestructingSolverStorable13 [2022-07-19 21:58:47,900 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:47,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:47,900 INFO L85 PathProgramCache]: Analyzing trace with hash 691123421, now seen corresponding path program 1 times [2022-07-19 21:58:47,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:47,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494733580] [2022-07-19 21:58:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:47,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:58:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:58:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:58:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:48,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494733580] [2022-07-19 21:58:48,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494733580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:48,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:48,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:58:48,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931706473] [2022-07-19 21:58:48,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:48,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:58:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:48,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:58:48,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:58:48,045 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 21:58:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:48,200 INFO L93 Difference]: Finished difference Result 151 states and 178 transitions. [2022-07-19 21:58:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:58:48,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2022-07-19 21:58:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:48,201 INFO L225 Difference]: With dead ends: 151 [2022-07-19 21:58:48,201 INFO L226 Difference]: Without dead ends: 119 [2022-07-19 21:58:48,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:58:48,202 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:48,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 128 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:58:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-19 21:58:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-19 21:58:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 96 states have internal predecessors, (104), 16 states have call successors, (16), 8 states have call predecessors, (16), 11 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2022-07-19 21:58:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2022-07-19 21:58:48,206 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 54 [2022-07-19 21:58:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:48,206 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2022-07-19 21:58:48,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 21:58:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2022-07-19 21:58:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 21:58:48,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:48,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:48,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 21:58:48,207 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:48,207 INFO L85 PathProgramCache]: Analyzing trace with hash -324954328, now seen corresponding path program 1 times [2022-07-19 21:58:48,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:48,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371304954] [2022-07-19 21:58:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:48,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:58:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:58:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 21:58:48,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:48,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371304954] [2022-07-19 21:58:48,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371304954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:48,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:48,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:58:48,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859367169] [2022-07-19 21:58:48,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:48,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:58:48,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:48,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:58:48,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:58:48,395 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-19 21:58:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:48,659 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2022-07-19 21:58:48,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:58:48,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2022-07-19 21:58:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:48,660 INFO L225 Difference]: With dead ends: 131 [2022-07-19 21:58:48,660 INFO L226 Difference]: Without dead ends: 129 [2022-07-19 21:58:48,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:58:48,661 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 92 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:48,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 284 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:58:48,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-19 21:58:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-07-19 21:58:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 97 states have (on average 1.134020618556701) internal successors, (110), 103 states have internal predecessors, (110), 17 states have call successors, (17), 9 states have call predecessors, (17), 13 states have return successors, (23), 15 states have call predecessors, (23), 16 states have call successors, (23) [2022-07-19 21:58:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2022-07-19 21:58:48,666 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 60 [2022-07-19 21:58:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:48,666 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2022-07-19 21:58:48,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-19 21:58:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2022-07-19 21:58:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 21:58:48,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:48,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:48,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 21:58:48,667 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:48,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2057101486, now seen corresponding path program 1 times [2022-07-19 21:58:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:48,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403397692] [2022-07-19 21:58:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:58:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:48,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:58:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:58:49,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:49,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403397692] [2022-07-19 21:58:49,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403397692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:49,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:49,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 21:58:49,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8001897] [2022-07-19 21:58:49,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:49,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:58:49,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:49,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:58:49,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:58:49,068 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 21:58:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:49,712 INFO L93 Difference]: Finished difference Result 190 states and 233 transitions. [2022-07-19 21:58:49,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:58:49,713 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2022-07-19 21:58:49,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:49,714 INFO L225 Difference]: With dead ends: 190 [2022-07-19 21:58:49,714 INFO L226 Difference]: Without dead ends: 161 [2022-07-19 21:58:49,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:58:49,715 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 181 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:49,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 255 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:58:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-19 21:58:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2022-07-19 21:58:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 116 states have internal predecessors, (124), 19 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (31), 18 states have call predecessors, (31), 18 states have call successors, (31) [2022-07-19 21:58:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2022-07-19 21:58:49,721 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 64 [2022-07-19 21:58:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:49,722 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2022-07-19 21:58:49,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 21:58:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2022-07-19 21:58:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 21:58:49,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:49,722 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:49,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 21:58:49,723 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:49,723 INFO L85 PathProgramCache]: Analyzing trace with hash 777237808, now seen corresponding path program 1 times [2022-07-19 21:58:49,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:49,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54160372] [2022-07-19 21:58:49,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:49,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:49,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:49,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:49,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:49,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:58:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:58:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 21:58:50,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:50,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54160372] [2022-07-19 21:58:50,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54160372] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:50,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065537273] [2022-07-19 21:58:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:50,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:50,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:50,065 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 21:58:50,091 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 21:58:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:50,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 2508 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-19 21:58:50,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:50,731 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-19 21:58:50,731 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 2 case distinctions, treesize of input 21 treesize of output 26 [2022-07-19 21:58:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:51,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:51,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065537273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:51,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:51,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 29 [2022-07-19 21:58:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888553512] [2022-07-19 21:58:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:51,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 21:58:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 21:58:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2022-07-19 21:58:51,494 INFO L87 Difference]: Start difference. First operand 144 states and 174 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 21:58:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:51,668 INFO L93 Difference]: Finished difference Result 231 states and 276 transitions. [2022-07-19 21:58:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:58:51,669 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-07-19 21:58:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:51,670 INFO L225 Difference]: With dead ends: 231 [2022-07-19 21:58:51,670 INFO L226 Difference]: Without dead ends: 189 [2022-07-19 21:58:51,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2022-07-19 21:58:51,670 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 19 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:51,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 987 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 173 Unchecked, 0.1s Time] [2022-07-19 21:58:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-19 21:58:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 181. [2022-07-19 21:58:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 141 states have (on average 1.148936170212766) internal successors, (162), 147 states have internal predecessors, (162), 21 states have call successors, (21), 12 states have call predecessors, (21), 18 states have return successors, (36), 21 states have call predecessors, (36), 20 states have call successors, (36) [2022-07-19 21:58:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 219 transitions. [2022-07-19 21:58:51,682 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 219 transitions. Word has length 64 [2022-07-19 21:58:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:51,682 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 219 transitions. [2022-07-19 21:58:51,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 21:58:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 219 transitions. [2022-07-19 21:58:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 21:58:51,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:51,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:51,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 21:58:51,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 21:58:51,894 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:51,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1069275532, now seen corresponding path program 1 times [2022-07-19 21:58:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:51,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788635596] [2022-07-19 21:58:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:51,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:52,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:52,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:52,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:52,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:52,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:58:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:58:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 21:58:52,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:52,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788635596] [2022-07-19 21:58:52,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788635596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:52,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313600958] [2022-07-19 21:58:52,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:52,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:52,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:52,285 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 21:58:52,287 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 21:58:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:52,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-19 21:58:52,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:52,830 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-19 21:58:52,831 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 2 case distinctions, treesize of input 21 treesize of output 26 [2022-07-19 21:58:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:53,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:53,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313600958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:53,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:53,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [15] total 30 [2022-07-19 21:58:53,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305861021] [2022-07-19 21:58:53,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:53,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 21:58:53,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:53,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 21:58:53,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2022-07-19 21:58:53,646 INFO L87 Difference]: Start difference. First operand 181 states and 219 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 21:58:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:53,764 INFO L93 Difference]: Finished difference Result 222 states and 265 transitions. [2022-07-19 21:58:53,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 21:58:53,765 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-07-19 21:58:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:53,766 INFO L225 Difference]: With dead ends: 222 [2022-07-19 21:58:53,766 INFO L226 Difference]: Without dead ends: 188 [2022-07-19 21:58:53,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2022-07-19 21:58:53,767 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:53,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 747 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 110 Unchecked, 0.1s Time] [2022-07-19 21:58:53,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-19 21:58:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2022-07-19 21:58:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 141 states have (on average 1.148936170212766) internal successors, (162), 147 states have internal predecessors, (162), 21 states have call successors, (21), 12 states have call predecessors, (21), 18 states have return successors, (36), 21 states have call predecessors, (36), 20 states have call successors, (36) [2022-07-19 21:58:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 219 transitions. [2022-07-19 21:58:53,774 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 219 transitions. Word has length 64 [2022-07-19 21:58:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:53,774 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 219 transitions. [2022-07-19 21:58:53,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 21:58:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 219 transitions. [2022-07-19 21:58:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 21:58:53,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:53,776 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:53,801 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 21:58:53,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:53,987 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash -418268106, now seen corresponding path program 1 times [2022-07-19 21:58:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:53,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410885682] [2022-07-19 21:58:53,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:58:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:58:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 21:58:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 21:58:54,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:54,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410885682] [2022-07-19 21:58:54,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410885682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:54,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:54,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 21:58:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469442929] [2022-07-19 21:58:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:54,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:58:54,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:58:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:58:54,245 INFO L87 Difference]: Start difference. First operand 181 states and 219 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 21:58:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:54,688 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2022-07-19 21:58:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:58:54,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2022-07-19 21:58:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:54,690 INFO L225 Difference]: With dead ends: 187 [2022-07-19 21:58:54,690 INFO L226 Difference]: Without dead ends: 185 [2022-07-19 21:58:54,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:58:54,691 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 49 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:54,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 165 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:58:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-19 21:58:54,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-19 21:58:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 144 states have (on average 1.1458333333333333) internal successors, (165), 150 states have internal predecessors, (165), 21 states have call successors, (21), 13 states have call predecessors, (21), 19 states have return successors, (36), 21 states have call predecessors, (36), 20 states have call successors, (36) [2022-07-19 21:58:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2022-07-19 21:58:54,698 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 66 [2022-07-19 21:58:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:54,699 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2022-07-19 21:58:54,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 21:58:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2022-07-19 21:58:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 21:58:54,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:54,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:54,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 21:58:54,700 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:54,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1498102261, now seen corresponding path program 1 times [2022-07-19 21:58:54,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:54,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663242959] [2022-07-19 21:58:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:54,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:58:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:58:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 21:58:54,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:54,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663242959] [2022-07-19 21:58:54,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663242959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:54,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:54,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:58:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363524100] [2022-07-19 21:58:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:54,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:58:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:58:54,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:58:54,856 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-19 21:58:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:55,043 INFO L93 Difference]: Finished difference Result 241 states and 284 transitions. [2022-07-19 21:58:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:58:55,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-07-19 21:58:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:55,044 INFO L225 Difference]: With dead ends: 241 [2022-07-19 21:58:55,044 INFO L226 Difference]: Without dead ends: 189 [2022-07-19 21:58:55,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:58:55,045 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 46 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:55,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 166 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:58:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-19 21:58:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2022-07-19 21:58:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 137 states have (on average 1.1313868613138687) internal successors, (155), 143 states have internal predecessors, (155), 21 states have call successors, (21), 13 states have call predecessors, (21), 19 states have return successors, (35), 21 states have call predecessors, (35), 20 states have call successors, (35) [2022-07-19 21:58:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2022-07-19 21:58:55,053 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 211 transitions. Word has length 66 [2022-07-19 21:58:55,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:55,053 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 211 transitions. [2022-07-19 21:58:55,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-19 21:58:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 211 transitions. [2022-07-19 21:58:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 21:58:55,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:55,054 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:55,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 21:58:55,055 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash 820275769, now seen corresponding path program 1 times [2022-07-19 21:58:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:55,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593341677] [2022-07-19 21:58:55,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:55,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:58:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:58:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 21:58:55,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:55,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593341677] [2022-07-19 21:58:55,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593341677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:55,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:55,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 21:58:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387583072] [2022-07-19 21:58:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:58:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:58:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:58:55,257 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-19 21:58:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:55,625 INFO L93 Difference]: Finished difference Result 192 states and 225 transitions. [2022-07-19 21:58:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:58:55,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-07-19 21:58:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:55,628 INFO L225 Difference]: With dead ends: 192 [2022-07-19 21:58:55,628 INFO L226 Difference]: Without dead ends: 190 [2022-07-19 21:58:55,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:58:55,628 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 96 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:55,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 351 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:58:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-19 21:58:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2022-07-19 21:58:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 142 states have (on average 1.1267605633802817) internal successors, (160), 149 states have internal predecessors, (160), 21 states have call successors, (21), 13 states have call predecessors, (21), 20 states have return successors, (36), 21 states have call predecessors, (36), 20 states have call successors, (36) [2022-07-19 21:58:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 217 transitions. [2022-07-19 21:58:55,637 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 217 transitions. Word has length 66 [2022-07-19 21:58:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:55,638 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 217 transitions. [2022-07-19 21:58:55,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-19 21:58:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 217 transitions. [2022-07-19 21:58:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 21:58:55,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:55,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:55,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 21:58:55,639 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1521340347, now seen corresponding path program 1 times [2022-07-19 21:58:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:55,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779605949] [2022-07-19 21:58:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:58:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:58:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 21:58:55,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:55,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779605949] [2022-07-19 21:58:55,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779605949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:55,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968825243] [2022-07-19 21:58:55,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:55,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:55,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:55,975 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 21:58:55,980 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 21:58:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:56,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 2520 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 21:58:56,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:56,501 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-19 21:58:56,501 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 2 case distinctions, treesize of input 21 treesize of output 26 [2022-07-19 21:58:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:58:57,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:57,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968825243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:57,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:57,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2022-07-19 21:58:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886351547] [2022-07-19 21:58:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:57,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:58:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:57,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:58:57,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-07-19 21:58:57,077 INFO L87 Difference]: Start difference. First operand 184 states and 217 transitions. Second operand has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 21:58:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:57,145 INFO L93 Difference]: Finished difference Result 237 states and 272 transitions. [2022-07-19 21:58:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 21:58:57,145 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 66 [2022-07-19 21:58:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:57,146 INFO L225 Difference]: With dead ends: 237 [2022-07-19 21:58:57,146 INFO L226 Difference]: Without dead ends: 198 [2022-07-19 21:58:57,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2022-07-19 21:58:57,147 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 27 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:57,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 705 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 118 Unchecked, 0.0s Time] [2022-07-19 21:58:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-19 21:58:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2022-07-19 21:58:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 150 states have (on average 1.12) internal successors, (168), 157 states have internal predecessors, (168), 21 states have call successors, (21), 13 states have call predecessors, (21), 20 states have return successors, (34), 21 states have call predecessors, (34), 20 states have call successors, (34) [2022-07-19 21:58:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 223 transitions. [2022-07-19 21:58:57,155 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 223 transitions. Word has length 66 [2022-07-19 21:58:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:57,155 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 223 transitions. [2022-07-19 21:58:57,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 21:58:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 223 transitions. [2022-07-19 21:58:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 21:58:57,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:57,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:57,178 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 21:58:57,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-19 21:58:57,371 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1978442555, now seen corresponding path program 1 times [2022-07-19 21:58:57,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:57,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741828447] [2022-07-19 21:58:57,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:57,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:57,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:57,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:57,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:57,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:58:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:58:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:58:57,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:57,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741828447] [2022-07-19 21:58:57,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741828447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:57,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:57,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 21:58:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969827031] [2022-07-19 21:58:57,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:57,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:58:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:58:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:58:57,670 INFO L87 Difference]: Start difference. First operand 192 states and 223 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 21:58:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:58,250 INFO L93 Difference]: Finished difference Result 251 states and 293 transitions. [2022-07-19 21:58:58,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:58:58,250 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2022-07-19 21:58:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:58,252 INFO L225 Difference]: With dead ends: 251 [2022-07-19 21:58:58,252 INFO L226 Difference]: Without dead ends: 194 [2022-07-19 21:58:58,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:58:58,253 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 175 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:58,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 354 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:58:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-19 21:58:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 171. [2022-07-19 21:58:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.0916030534351144) internal successors, (143), 136 states have internal predecessors, (143), 21 states have call successors, (21), 13 states have call predecessors, (21), 18 states have return successors, (31), 21 states have call predecessors, (31), 20 states have call successors, (31) [2022-07-19 21:58:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 195 transitions. [2022-07-19 21:58:58,261 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 195 transitions. Word has length 70 [2022-07-19 21:58:58,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:58,261 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 195 transitions. [2022-07-19 21:58:58,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 21:58:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 195 transitions. [2022-07-19 21:58:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 21:58:58,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:58,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:58,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 21:58:58,263 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:58,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash 698578877, now seen corresponding path program 1 times [2022-07-19 21:58:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:58,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591406064] [2022-07-19 21:58:58,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:58,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:58:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:58:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:58:58,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:58,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591406064] [2022-07-19 21:58:58,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591406064] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:58,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812268754] [2022-07-19 21:58:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:58,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:58,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:58,540 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 21:58:58,558 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 21:58:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 2517 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 21:58:58,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:59,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:59,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:59,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:59,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-19 21:58:59,258 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 21:58:59,258 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 26 treesize of output 14 [2022-07-19 21:58:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 21:58:59,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:59,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812268754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:59,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:59,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-07-19 21:58:59,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022909939] [2022-07-19 21:58:59,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:59,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:58:59,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:59,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:58:59,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:58:59,267 INFO L87 Difference]: Start difference. First operand 171 states and 195 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 21:58:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:59,365 INFO L93 Difference]: Finished difference Result 272 states and 303 transitions. [2022-07-19 21:58:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:58:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2022-07-19 21:58:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:59,367 INFO L225 Difference]: With dead ends: 272 [2022-07-19 21:58:59,367 INFO L226 Difference]: Without dead ends: 177 [2022-07-19 21:58:59,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:58:59,368 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 18 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:59,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 432 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2022-07-19 21:58:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-19 21:58:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-07-19 21:58:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.0875912408759123) internal successors, (149), 142 states have internal predecessors, (149), 21 states have call successors, (21), 13 states have call predecessors, (21), 18 states have return successors, (30), 21 states have call predecessors, (30), 20 states have call successors, (30) [2022-07-19 21:58:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 200 transitions. [2022-07-19 21:58:59,378 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 200 transitions. Word has length 70 [2022-07-19 21:58:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:59,378 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 200 transitions. [2022-07-19 21:58:59,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 21:58:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 200 transitions. [2022-07-19 21:58:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 21:58:59,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:59,380 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:59,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-19 21:58:59,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:59,596 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:59,596 INFO L85 PathProgramCache]: Analyzing trace with hash 304212091, now seen corresponding path program 1 times [2022-07-19 21:58:59,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:59,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398453750] [2022-07-19 21:58:59,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:59,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:58:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:58:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:58:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:58:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:58:59,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:59,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398453750] [2022-07-19 21:58:59,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398453750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:59,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:59,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 21:58:59,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479078525] [2022-07-19 21:58:59,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:59,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:58:59,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:59,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:58:59,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:58:59,987 INFO L87 Difference]: Start difference. First operand 177 states and 200 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 21:59:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:00,643 INFO L93 Difference]: Finished difference Result 238 states and 273 transitions. [2022-07-19 21:59:00,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:59:00,643 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2022-07-19 21:59:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:00,644 INFO L225 Difference]: With dead ends: 238 [2022-07-19 21:59:00,644 INFO L226 Difference]: Without dead ends: 205 [2022-07-19 21:59:00,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:59:00,645 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 154 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:00,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 362 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 21:59:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-19 21:59:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 182. [2022-07-19 21:59:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 141 states have (on average 1.0851063829787233) internal successors, (153), 147 states have internal predecessors, (153), 21 states have call successors, (21), 13 states have call predecessors, (21), 19 states have return successors, (31), 21 states have call predecessors, (31), 20 states have call successors, (31) [2022-07-19 21:59:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 205 transitions. [2022-07-19 21:59:00,655 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 205 transitions. Word has length 70 [2022-07-19 21:59:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:00,655 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 205 transitions. [2022-07-19 21:59:00,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 21:59:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 205 transitions. [2022-07-19 21:59:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 21:59:00,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:00,656 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:00,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 21:59:00,657 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1542301249, now seen corresponding path program 1 times [2022-07-19 21:59:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:00,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704570588] [2022-07-19 21:59:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:59:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 21:59:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704570588] [2022-07-19 21:59:01,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704570588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880107450] [2022-07-19 21:59:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:01,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:01,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:01,247 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 21:59:01,248 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 21:59:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-19 21:59:01,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:01,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:01,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:01,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:01,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-19 21:59:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:59:02,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:02,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880107450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:02,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:02,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [21] total 32 [2022-07-19 21:59:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841341214] [2022-07-19 21:59:02,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:02,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:59:02,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:02,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:59:02,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2022-07-19 21:59:02,683 INFO L87 Difference]: Start difference. First operand 182 states and 205 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 21:59:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:02,779 INFO L93 Difference]: Finished difference Result 219 states and 245 transitions. [2022-07-19 21:59:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 21:59:02,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 70 [2022-07-19 21:59:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:02,790 INFO L225 Difference]: With dead ends: 219 [2022-07-19 21:59:02,790 INFO L226 Difference]: Without dead ends: 181 [2022-07-19 21:59:02,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 21:59:02,791 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:02,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 816 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 161 Unchecked, 0.1s Time] [2022-07-19 21:59:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-19 21:59:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2022-07-19 21:59:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 137 states have internal predecessors, (143), 21 states have call successors, (21), 13 states have call predecessors, (21), 18 states have return successors, (29), 21 states have call predecessors, (29), 20 states have call successors, (29) [2022-07-19 21:59:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2022-07-19 21:59:02,801 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 70 [2022-07-19 21:59:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:02,801 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2022-07-19 21:59:02,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 21:59:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2022-07-19 21:59:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 21:59:02,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:02,802 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:02,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:03,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:03,016 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2083530690, now seen corresponding path program 1 times [2022-07-19 21:59:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:03,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119624471] [2022-07-19 21:59:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:03,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:59:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:59:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 21:59:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 21:59:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 21:59:03,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:03,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119624471] [2022-07-19 21:59:03,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119624471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:03,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:03,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 21:59:03,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811918164] [2022-07-19 21:59:03,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:03,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 21:59:03,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:03,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 21:59:03,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:59:03,338 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 21:59:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:04,012 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2022-07-19 21:59:04,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:59:04,013 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 72 [2022-07-19 21:59:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:04,014 INFO L225 Difference]: With dead ends: 195 [2022-07-19 21:59:04,014 INFO L226 Difference]: Without dead ends: 193 [2022-07-19 21:59:04,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:59:04,015 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 53 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:04,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 21:59:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-19 21:59:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2022-07-19 21:59:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 137 states have (on average 1.0802919708029197) internal successors, (148), 142 states have internal predecessors, (148), 25 states have call successors, (25), 14 states have call predecessors, (25), 19 states have return successors, (33), 25 states have call predecessors, (33), 24 states have call successors, (33) [2022-07-19 21:59:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 206 transitions. [2022-07-19 21:59:04,034 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 206 transitions. Word has length 72 [2022-07-19 21:59:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:04,036 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 206 transitions. [2022-07-19 21:59:04,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 21:59:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 206 transitions. [2022-07-19 21:59:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 21:59:04,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:04,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:04,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 21:59:04,038 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:04,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash 683060159, now seen corresponding path program 1 times [2022-07-19 21:59:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:04,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149162292] [2022-07-19 21:59:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:04,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:59:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:59:04,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:04,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149162292] [2022-07-19 21:59:04,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149162292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:04,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:04,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 21:59:04,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355789135] [2022-07-19 21:59:04,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:04,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:59:04,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:04,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:59:04,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:59:04,370 INFO L87 Difference]: Start difference. First operand 182 states and 206 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 21:59:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:05,075 INFO L93 Difference]: Finished difference Result 234 states and 264 transitions. [2022-07-19 21:59:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:59:05,076 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2022-07-19 21:59:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:05,077 INFO L225 Difference]: With dead ends: 234 [2022-07-19 21:59:05,077 INFO L226 Difference]: Without dead ends: 187 [2022-07-19 21:59:05,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:59:05,078 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 95 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:05,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 244 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 21:59:05,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-19 21:59:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2022-07-19 21:59:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 128 states have (on average 1.078125) internal successors, (138), 132 states have internal predecessors, (138), 25 states have call successors, (25), 14 states have call predecessors, (25), 18 states have return successors, (32), 25 states have call predecessors, (32), 24 states have call successors, (32) [2022-07-19 21:59:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 195 transitions. [2022-07-19 21:59:05,088 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 195 transitions. Word has length 70 [2022-07-19 21:59:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:05,089 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 195 transitions. [2022-07-19 21:59:05,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 21:59:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2022-07-19 21:59:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 21:59:05,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:05,090 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:05,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 21:59:05,090 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:05,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:05,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2084807610, now seen corresponding path program 1 times [2022-07-19 21:59:05,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:05,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891090803] [2022-07-19 21:59:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:59:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:59:05,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:05,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891090803] [2022-07-19 21:59:05,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891090803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:05,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:05,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-19 21:59:05,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895223834] [2022-07-19 21:59:05,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:05,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 21:59:05,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:05,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 21:59:05,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2022-07-19 21:59:05,636 INFO L87 Difference]: Start difference. First operand 172 states and 195 transitions. Second operand has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 21:59:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:06,787 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2022-07-19 21:59:06,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 21:59:06,788 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 72 [2022-07-19 21:59:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:06,788 INFO L225 Difference]: With dead ends: 195 [2022-07-19 21:59:06,788 INFO L226 Difference]: Without dead ends: 193 [2022-07-19 21:59:06,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 21:59:06,790 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 109 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:06,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 563 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 21:59:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-19 21:59:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 175. [2022-07-19 21:59:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 131 states have (on average 1.0763358778625953) internal successors, (141), 135 states have internal predecessors, (141), 24 states have call successors, (24), 15 states have call predecessors, (24), 19 states have return successors, (31), 24 states have call predecessors, (31), 23 states have call successors, (31) [2022-07-19 21:59:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2022-07-19 21:59:06,801 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 72 [2022-07-19 21:59:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:06,801 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2022-07-19 21:59:06,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 21:59:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2022-07-19 21:59:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 21:59:06,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:06,802 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:06,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 21:59:06,802 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:06,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1210932874, now seen corresponding path program 1 times [2022-07-19 21:59:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:06,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345212777] [2022-07-19 21:59:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:59:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:59:07,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:07,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345212777] [2022-07-19 21:59:07,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345212777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:07,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:07,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 21:59:07,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995413001] [2022-07-19 21:59:07,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:07,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:59:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:07,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:59:07,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:59:07,080 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 21:59:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:07,667 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2022-07-19 21:59:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:59:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2022-07-19 21:59:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:07,670 INFO L225 Difference]: With dead ends: 224 [2022-07-19 21:59:07,670 INFO L226 Difference]: Without dead ends: 187 [2022-07-19 21:59:07,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-07-19 21:59:07,671 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 64 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:07,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 216 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:59:07,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-19 21:59:07,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2022-07-19 21:59:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 131 states have (on average 1.0763358778625953) internal successors, (141), 135 states have internal predecessors, (141), 23 states have call successors, (23), 15 states have call predecessors, (23), 19 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2022-07-19 21:59:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2022-07-19 21:59:07,681 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 72 [2022-07-19 21:59:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:07,681 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2022-07-19 21:59:07,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 9 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 21:59:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2022-07-19 21:59:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-19 21:59:07,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:07,682 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:07,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 21:59:07,682 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1862370124, now seen corresponding path program 1 times [2022-07-19 21:59:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:07,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400316577] [2022-07-19 21:59:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:59:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:59:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 21:59:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 21:59:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 21:59:07,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:07,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400316577] [2022-07-19 21:59:07,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400316577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:07,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:07,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:59:07,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470303931] [2022-07-19 21:59:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:07,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:59:07,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:07,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:59:07,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:59:07,929 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 21:59:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:08,251 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2022-07-19 21:59:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:59:08,251 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 78 [2022-07-19 21:59:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:08,252 INFO L225 Difference]: With dead ends: 180 [2022-07-19 21:59:08,252 INFO L226 Difference]: Without dead ends: 178 [2022-07-19 21:59:08,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:59:08,253 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 74 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:08,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 202 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-19 21:59:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-19 21:59:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 134 states have (on average 1.0746268656716418) internal successors, (144), 138 states have internal predecessors, (144), 23 states have call successors, (23), 16 states have call predecessors, (23), 20 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2022-07-19 21:59:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2022-07-19 21:59:08,264 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 78 [2022-07-19 21:59:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:08,264 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2022-07-19 21:59:08,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 21:59:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2022-07-19 21:59:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-19 21:59:08,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:08,265 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:08,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 21:59:08,265 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1440681711, now seen corresponding path program 1 times [2022-07-19 21:59:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:08,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826351684] [2022-07-19 21:59:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:08,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 21:59:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 21:59:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 21:59:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 21:59:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-19 21:59:08,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:08,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826351684] [2022-07-19 21:59:08,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826351684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:08,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:08,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:59:08,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227577784] [2022-07-19 21:59:08,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:08,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:59:08,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:08,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:59:08,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:59:08,473 INFO L87 Difference]: Start difference. First operand 178 states and 196 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 21:59:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:08,848 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2022-07-19 21:59:08,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:59:08,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 85 [2022-07-19 21:59:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:08,850 INFO L225 Difference]: With dead ends: 202 [2022-07-19 21:59:08,850 INFO L226 Difference]: Without dead ends: 101 [2022-07-19 21:59:08,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:59:08,851 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 33 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:08,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 225 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-19 21:59:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-19 21:59:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.027027027027027) internal successors, (76), 75 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-07-19 21:59:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-07-19 21:59:08,859 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 85 [2022-07-19 21:59:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:08,859 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-07-19 21:59:08,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 21:59:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-07-19 21:59:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 21:59:08,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:08,860 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:08,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-19 21:59:08,860 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1866661214, now seen corresponding path program 1 times [2022-07-19 21:59:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:08,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681601606] [2022-07-19 21:59:08,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:59:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 21:59:09,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:09,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681601606] [2022-07-19 21:59:09,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681601606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:09,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:09,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 21:59:09,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215409479] [2022-07-19 21:59:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:09,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 21:59:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:09,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 21:59:09,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:59:09,231 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-19 21:59:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:09,751 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-07-19 21:59:09,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:59:09,752 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 84 [2022-07-19 21:59:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:09,752 INFO L225 Difference]: With dead ends: 142 [2022-07-19 21:59:09,752 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 21:59:09,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-19 21:59:09,753 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:09,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 180 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:59:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 21:59:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-07-19 21:59:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-19 21:59:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-07-19 21:59:09,760 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 84 [2022-07-19 21:59:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:09,760 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-07-19 21:59:09,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-19 21:59:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-07-19 21:59:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 21:59:09,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:09,761 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:09,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-19 21:59:09,761 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:09,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash 61222880, now seen corresponding path program 1 times [2022-07-19 21:59:09,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:09,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714321757] [2022-07-19 21:59:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:59:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 21:59:10,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:10,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714321757] [2022-07-19 21:59:10,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714321757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:10,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:10,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 21:59:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692669505] [2022-07-19 21:59:10,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:10,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 21:59:10,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:10,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 21:59:10,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:59:10,153 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 21:59:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:10,670 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-07-19 21:59:10,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:59:10,670 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 84 [2022-07-19 21:59:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:10,671 INFO L225 Difference]: With dead ends: 90 [2022-07-19 21:59:10,671 INFO L226 Difference]: Without dead ends: 88 [2022-07-19 21:59:10,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:59:10,671 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 70 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:10,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 171 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:59:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-19 21:59:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-19 21:59:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 62 states have internal predecessors, (62), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-19 21:59:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2022-07-19 21:59:10,678 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 84 [2022-07-19 21:59:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:10,679 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2022-07-19 21:59:10,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 9 states have internal predecessors, (40), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 21:59:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2022-07-19 21:59:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-19 21:59:10,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:10,680 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:10,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-19 21:59:10,680 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:10,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2072795247, now seen corresponding path program 1 times [2022-07-19 21:59:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:10,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779007435] [2022-07-19 21:59:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:10,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:59:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 21:59:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 21:59:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-19 21:59:11,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:11,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779007435] [2022-07-19 21:59:11,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779007435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:11,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:11,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 21:59:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342913808] [2022-07-19 21:59:11,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:11,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 21:59:11,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 21:59:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:59:11,081 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 21:59:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:11,576 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-07-19 21:59:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:59:11,577 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 97 [2022-07-19 21:59:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:11,577 INFO L225 Difference]: With dead ends: 94 [2022-07-19 21:59:11,577 INFO L226 Difference]: Without dead ends: 90 [2022-07-19 21:59:11,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-07-19 21:59:11,578 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 78 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:11,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 183 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:59:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-19 21:59:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-19 21:59:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.0) internal successors, (63), 63 states have internal predecessors, (63), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-19 21:59:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2022-07-19 21:59:11,586 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 97 [2022-07-19 21:59:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:11,586 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2022-07-19 21:59:11,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 21:59:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2022-07-19 21:59:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-19 21:59:11,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:11,587 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:11,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-19 21:59:11,588 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:11,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash 654673100, now seen corresponding path program 1 times [2022-07-19 21:59:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:11,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673736507] [2022-07-19 21:59:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:11,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 21:59:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 21:59:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:59:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 21:59:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 21:59:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:59:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:59:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 21:59:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-19 21:59:12,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:12,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673736507] [2022-07-19 21:59:12,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673736507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:12,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:12,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-19 21:59:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084941344] [2022-07-19 21:59:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:12,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 21:59:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 21:59:12,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2022-07-19 21:59:12,804 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-19 21:59:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:13,410 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2022-07-19 21:59:13,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 21:59:13,410 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 114 [2022-07-19 21:59:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:13,410 INFO L225 Difference]: With dead ends: 90 [2022-07-19 21:59:13,410 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 21:59:13,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-07-19 21:59:13,411 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:13,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 197 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:59:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 21:59:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 21:59:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:59:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 21:59:13,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2022-07-19 21:59:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:13,412 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 21:59:13,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-19 21:59:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 21:59:13,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 21:59:13,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 21:59:13,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-19 21:59:13,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 21:59:15,419 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-19 21:59:15,419 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-19 21:59:15,419 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-19 21:59:15,419 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-19 21:59:15,420 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2022-07-19 21:59:15,420 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-19 21:59:15,421 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-19 21:59:15,421 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-19 21:59:15,421 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-19 21:59:15,421 INFO L895 garLoopResultBuilder]: At program point L8214(line 8214) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse11 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse12 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8)) (.cse14 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse13 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse10 (select .cse15 |aws_byte_buf_from_array_~#buf~1.offset|))) (let ((.cse1 (= (select .cse15 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16)) .cse10)) (.cse3 (= (select .cse14 .cse13) 0)) (.cse2 (select .cse14 .cse12)) (.cse4 (= (select .cse11 .cse13) 0)) (.cse5 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse0 (select .cse11 .cse12)) (.cse6 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse7 (= |aws_byte_buf_from_array_#in~len| .cse10)) (.cse8 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse9 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= .cse0 0) .cse1 (= .cse2 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (mod aws_byte_buf_from_array_~len 18446744073709551616) 0)) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) .cse1 .cse3 (= .cse2 |aws_byte_buf_from_array_#in~bytes.offset|) .cse4 (< 0 (mod |aws_byte_buf_from_array_#in~len| 18446744073709551616)) .cse5 (= .cse0 |aws_byte_buf_from_array_#in~bytes.base|) .cse6 .cse7 .cse8 .cse9))))) [2022-07-19 21:59:15,421 INFO L899 garLoopResultBuilder]: For program point L8214-2(line 8214) no Hoare annotation was computed. [2022-07-19 21:59:15,421 INFO L895 garLoopResultBuilder]: At program point L8214-1(line 8214) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse14 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse15 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8)) (.cse17 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse16 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse13 (select .cse18 |aws_byte_buf_from_array_~#buf~1.offset|))) (let ((.cse1 (= (select .cse18 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16)) .cse13)) (.cse3 (<= 1 |aws_byte_buf_from_array_#t~ret1053|)) (.cse4 (= (select .cse17 .cse16) 0)) (.cse2 (select .cse17 .cse15)) (.cse5 (= (select .cse14 .cse16) 0)) (.cse6 (<= |aws_byte_buf_from_array_#t~ret1053| 1)) (.cse7 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse0 (select .cse14 .cse15)) (.cse8 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse9 (not (= aws_byte_buf_from_array_~bytes.base 0))) (.cse10 (= |aws_byte_buf_from_array_#in~len| .cse13)) (.cse11 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse12 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (and (= .cse0 0) .cse1 (= .cse2 0) .cse3 .cse4 (<= 0 (+ |aws_byte_buf_from_array_#in~len| (* (div (* (- 1) |aws_byte_buf_from_array_#in~len|) 18446744073709551616) 18446744073709551616))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) .cse1 .cse3 .cse4 (= .cse2 |aws_byte_buf_from_array_#in~bytes.offset|) .cse5 .cse6 (< 0 (mod |aws_byte_buf_from_array_#in~len| 18446744073709551616)) .cse7 (= .cse0 |aws_byte_buf_from_array_#in~bytes.base|) .cse8 .cse9 .cse10 .cse11 .cse12) (= |aws_byte_buf_from_array_#in~bytes.base| 0))))) [2022-07-19 21:59:15,421 INFO L899 garLoopResultBuilder]: For program point L8206(lines 8206 8207) no Hoare annotation was computed. [2022-07-19 21:59:15,421 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayFINAL(lines 8203 8216) no Hoare annotation was computed. [2022-07-19 21:59:15,421 INFO L899 garLoopResultBuilder]: For program point L8204-1(line 8204) no Hoare annotation was computed. [2022-07-19 21:59:15,422 INFO L895 garLoopResultBuilder]: At program point L8204(line 8204) the Hoare annotation is: (or (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|) (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) [2022-07-19 21:59:15,422 INFO L899 garLoopResultBuilder]: For program point L8206-2(lines 8206 8207) no Hoare annotation was computed. [2022-07-19 21:59:15,422 INFO L895 garLoopResultBuilder]: At program point aws_byte_buf_from_arrayENTRY(lines 8203 8216) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (= |aws_byte_buf_from_array_#in~bytes.base| 0)) [2022-07-19 21:59:15,422 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayEXIT(lines 8203 8216) no Hoare annotation was computed. [2022-07-19 21:59:15,422 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-19 21:59:15,422 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-19 21:59:15,422 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-19 21:59:15,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 21:59:15,422 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-19 21:59:15,422 INFO L899 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2022-07-19 21:59:15,423 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-19 21:59:15,423 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select .cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse4)) (= (select .cse2 .cse4) 0) (= (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-19 21:59:15,423 INFO L895 garLoopResultBuilder]: At program point L8971(lines 8971 8973) the Hoare annotation is: (let ((.cse10 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse13 .cse14) 0)) (.cse2 (= (select .cse11 .cse14) 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse7 (select .cse13 .cse12)) (.cse4 (= (select .cse11 .cse12) 0)) (.cse5 (= (select .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1214#1.base| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1214#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select .cse10 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse7) .cse4 .cse5 .cse6 .cse8 .cse9 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))))) [2022-07-19 21:59:15,423 INFO L899 garLoopResultBuilder]: For program point L8971-1(lines 8971 8973) no Hoare annotation was computed. [2022-07-19 21:59:15,423 INFO L895 garLoopResultBuilder]: At program point L8965(line 8965) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) [2022-07-19 21:59:15,423 INFO L899 garLoopResultBuilder]: For program point L8965-1(line 8965) no Hoare annotation was computed. [2022-07-19 21:59:15,423 INFO L895 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse14 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse10 (select .cse14 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse11 .cse15) 0)) (.cse2 (= (select .cse13 .cse15) 0)) (.cse3 (= (select .cse14 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse6 (= (select .cse13 .cse12) 0)) (.cse7 (= .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse5 (select .cse11 .cse12)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1212#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse5) .cse6 .cse7 .cse8 .cse9 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (<= .cse10 (* (div .cse10 18446744073709551616) 18446744073709551616)) (= .cse5 0) .cse9))))) [2022-07-19 21:59:15,424 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-19 21:59:15,424 INFO L899 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2022-07-19 21:59:15,424 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select .cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse4)) (= (select .cse2 .cse4) 0) (= (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-19 21:59:15,424 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 21:59:15,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 21:59:15,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 21:59:15,424 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-19 21:59:15,424 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2022-07-19 21:59:15,424 INFO L902 garLoopResultBuilder]: At program point L8978(line 8978) the Hoare annotation is: true [2022-07-19 21:59:15,425 INFO L899 garLoopResultBuilder]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2022-07-19 21:59:15,425 INFO L895 garLoopResultBuilder]: At program point L8970(line 8970) the Hoare annotation is: (let ((.cse14 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse10 (select .cse14 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (= (select .cse11 .cse15) 0)) (.cse2 (= (select .cse13 .cse15) 0)) (.cse3 (= (select .cse14 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse6 (= (select .cse13 .cse12) 0)) (.cse7 (= .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1213#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse5 (select .cse11 .cse12))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse5) .cse6 .cse7 .cse8 .cse9 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (* (div .cse10 18446744073709551616) 18446744073709551616)) (= .cse5 0)))))) [2022-07-19 21:59:15,425 INFO L899 garLoopResultBuilder]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2022-07-19 21:59:15,425 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select .cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse4)) (= (select .cse2 .cse4) 0) (= (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_#t~mem589#1| |ULTIMATE.start_assert_bytes_match_#t~mem588#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-19 21:59:15,425 INFO L902 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2022-07-19 21:59:15,425 INFO L899 garLoopResultBuilder]: For program point L8970-1(line 8970) no Hoare annotation was computed. [2022-07-19 21:59:15,425 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= (select .cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse4)) (= (select .cse2 .cse4) 0) (= (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-07-19 21:59:15,426 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse12 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse14 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse11 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse5 (select .cse14 .cse11)) (.cse9 (select .cse12 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse13 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse14 .cse13) 0)) (.cse1 (= (select .cse10 .cse13) 0)) (.cse3 (= (select .cse12 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse6 (= (select .cse10 .cse11) 0)) (.cse7 (= .cse9 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse2 (= .cse5 0))) (or (and .cse0 .cse1 (not .cse2) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse5) .cse6 .cse7 .cse8 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 (<= .cse9 (* (div .cse9 18446744073709551616) 18446744073709551616)) .cse2))))) [2022-07-19 21:59:15,426 INFO L895 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse17 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse15 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1211#1| 1)) (.cse2 (= (select .cse15 .cse19) 0)) (.cse3 (= (select .cse18 .cse19) 0)) (.cse4 (= (select .cse17 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse7 (= (select .cse18 .cse16) 0)) (.cse9 (<= 1 |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1211#1|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse8 (select .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse6 (select .cse15 .cse16))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse6) .cse7 (= .cse8 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse9 .cse10 (<= (+ (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616) 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (and .cse0 .cse1 .cse2 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_13| Int)) (let ((.cse14 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_13|))) (let ((.cse12 (select .cse14 16)) (.cse11 (select .cse14 0)) (.cse13 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (and (= .cse11 .cse12) (= (select .cse13 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) .cse12) (= .cse11 (select .cse13 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)))))) .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 (<= .cse8 (* (div .cse8 18446744073709551616) 18446744073709551616)) (= .cse6 0))))) [2022-07-19 21:59:15,426 INFO L899 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2022-07-19 21:59:15,426 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-19 21:59:15,426 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-19 21:59:15,426 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-19 21:59:15,426 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-19 21:59:15,426 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-19 21:59:15,426 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-19 21:59:15,427 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-19 21:59:15,429 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:15,430 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 21:59:15,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:59:15 BoogieIcfgContainer [2022-07-19 21:59:15,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 21:59:15,439 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 21:59:15,439 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 21:59:15,439 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 21:59:15,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:58:37" (3/4) ... [2022-07-19 21:59:15,462 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 21:59:15,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-19 21:59:15,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_from_array [2022-07-19 21:59:15,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-19 21:59:15,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-07-19 21:59:15,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-19 21:59:15,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-19 21:59:15,492 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 122 nodes and edges [2022-07-19 21:59:15,493 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-07-19 21:59:15,494 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-19 21:59:15,495 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-19 21:59:15,496 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-19 21:59:15,497 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-19 21:59:15,497 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 21:59:15,498 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 21:59:15,848 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 21:59:15,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 21:59:15,848 INFO L158 Benchmark]: Toolchain (without parser) took 41695.38ms. Allocated memory was 104.9MB in the beginning and 599.8MB in the end (delta: 494.9MB). Free memory was 66.2MB in the beginning and 157.6MB in the end (delta: -91.4MB). Peak memory consumption was 403.5MB. Max. memory is 16.1GB. [2022-07-19 21:59:15,849 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:59:15,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1805.28ms. Allocated memory was 104.9MB in the beginning and 195.0MB in the end (delta: 90.2MB). Free memory was 65.9MB in the beginning and 127.6MB in the end (delta: -61.7MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2022-07-19 21:59:15,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.10ms. Allocated memory is still 195.0MB. Free memory was 127.6MB in the beginning and 116.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 21:59:15,849 INFO L158 Benchmark]: Boogie Preprocessor took 99.18ms. Allocated memory is still 195.0MB. Free memory was 116.1MB in the beginning and 109.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 21:59:15,849 INFO L158 Benchmark]: RCFGBuilder took 1107.90ms. Allocated memory is still 195.0MB. Free memory was 109.8MB in the beginning and 107.2MB in the end (delta: 2.6MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2022-07-19 21:59:15,849 INFO L158 Benchmark]: TraceAbstraction took 38128.85ms. Allocated memory was 195.0MB in the beginning and 599.8MB in the end (delta: 404.8MB). Free memory was 106.1MB in the beginning and 287.6MB in the end (delta: -181.5MB). Peak memory consumption was 326.6MB. Max. memory is 16.1GB. [2022-07-19 21:59:15,850 INFO L158 Benchmark]: Witness Printer took 409.48ms. Allocated memory is still 599.8MB. Free memory was 287.6MB in the beginning and 157.6MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-19 21:59:15,850 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1805.28ms. Allocated memory was 104.9MB in the beginning and 195.0MB in the end (delta: 90.2MB). Free memory was 65.9MB in the beginning and 127.6MB in the end (delta: -61.7MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.10ms. Allocated memory is still 195.0MB. Free memory was 127.6MB in the beginning and 116.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.18ms. Allocated memory is still 195.0MB. Free memory was 116.1MB in the beginning and 109.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1107.90ms. Allocated memory is still 195.0MB. Free memory was 109.8MB in the beginning and 107.2MB in the end (delta: 2.6MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38128.85ms. Allocated memory was 195.0MB in the beginning and 599.8MB in the end (delta: 404.8MB). Free memory was 106.1MB in the beginning and 287.6MB in the end (delta: -181.5MB). Peak memory consumption was 326.6MB. Max. memory is 16.1GB. * Witness Printer took 409.48ms. Allocated memory is still 599.8MB. Free memory was 287.6MB in the beginning and 157.6MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.1s, OverallIterations: 37, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2975 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2782 mSDsluCounter, 11875 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 738 IncrementalHoareTripleChecker+Unchecked, 9168 mSDsCounter, 936 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15455 IncrementalHoareTripleChecker+Invalid, 17129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 936 mSolverCounterUnsat, 2707 mSDtfsCounter, 15455 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1528 GetRequests, 908 SyntacticMatches, 13 SemanticMatches, 607 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=23, InterpolantAutomatonStates: 419, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 358 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 271 PreInvPairs, 293 NumberOfFragments, 1601 HoareAnnotationTreeSize, 271 FomulaSimplifications, 4980 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 47268 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 2704 NumberOfCodeBlocks, 2704 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2660 ConstructedInterpolants, 176 QuantifiedInterpolants, 15937 SizeOfPredicates, 74 NumberOfNonLiveVariables, 17487 ConjunctsInSsa, 229 ConjunctsInUnsatCore, 44 InterpolantComputations, 37 PerfectInterpolantSequences, 823/870 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8978]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-19 21:59:15,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE