./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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_string_new_from_c_str_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 d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:34:34,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:34:34,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:34:34,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:34:34,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:34:34,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:34:34,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:34:34,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:34:34,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:34:34,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:34:34,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:34:34,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:34:34,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:34:34,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:34:34,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:34:34,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:34:34,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:34:34,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:34:34,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:34:34,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:34:34,143 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:34:34,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:34:34,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:34:34,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:34:34,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:34:34,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:34:34,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:34:34,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:34:34,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:34:34,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:34:34,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:34:34,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:34:34,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:34:34,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:34:34,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:34:34,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:34:34,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:34:34,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:34:34,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:34:34,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:34:34,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:34:34,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:34:34,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:34:34,184 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:34:34,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:34:34,185 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:34:34,185 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:34:34,186 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:34:34,186 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:34:34,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:34:34,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:34:34,187 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:34:34,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:34:34,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:34:34,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:34:34,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:34:34,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:34:34,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:34:34,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:34:34,189 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:34:34,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:34:34,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:34:34,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:34:34,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:34:34,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:34:34,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:34:34,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:34:34,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:34:34,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:34:34,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:34:34,192 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:34:34,193 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:34:34,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:34:34,193 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 -> d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd [2022-07-22 22:34:34,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:34:34,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:34:34,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:34:34,447 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:34:34,447 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:34:34,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-07-22 22:34:34,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2401af943/0ddc923fe01545b1b3e88b03851dda11/FLAG0a33c5ef9 [2022-07-22 22:34:35,173 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:34:35,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-07-22 22:34:35,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2401af943/0ddc923fe01545b1b3e88b03851dda11/FLAG0a33c5ef9 [2022-07-22 22:34:35,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2401af943/0ddc923fe01545b1b3e88b03851dda11 [2022-07-22 22:34:35,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:34:35,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:34:35,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:34:35,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:34:35,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:34:35,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:34:35" (1/1) ... [2022-07-22 22:34:35,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd0fdba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:35, skipping insertion in model container [2022-07-22 22:34:35,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:34:35" (1/1) ... [2022-07-22 22:34:35,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:34:35,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:34:35,833 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_string_new_from_c_str_harness.i[4499,4512] [2022-07-22 22:34:35,841 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_string_new_from_c_str_harness.i[4559,4572] [2022-07-22 22:34:36,585 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:36,586 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:36,586 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:36,587 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:36,588 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:36,599 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:36,600 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:36,604 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:36,604 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:36,838 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:34:36,839 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:34:36,840 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:34:36,841 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:34:36,843 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:34:36,843 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:34:36,844 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:34:36,844 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:34:36,845 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:34:36,846 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:34:36,958 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:34:37,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,075 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:34:37,316 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:34:37,336 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_string_new_from_c_str_harness.i[4499,4512] [2022-07-22 22:34:37,336 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_string_new_from_c_str_harness.i[4559,4572] [2022-07-22 22:34:37,359 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,360 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,360 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,361 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,361 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,366 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,367 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,367 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,368 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,410 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:34:37,410 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:34:37,411 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:34:37,412 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:34:37,413 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:34:37,418 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:34:37,419 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:34:37,420 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:34:37,420 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:34:37,420 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:34:37,435 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:34:37,495 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,496 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:37,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:34:37,772 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:34:37,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37 WrapperNode [2022-07-22 22:34:37,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:34:37,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:34:37,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:34:37,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:34:37,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (1/1) ... [2022-07-22 22:34:37,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (1/1) ... [2022-07-22 22:34:37,914 INFO L137 Inliner]: procedures = 690, calls = 2735, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 812 [2022-07-22 22:34:37,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:34:37,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:34:37,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:34:37,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:34:37,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (1/1) ... [2022-07-22 22:34:37,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (1/1) ... [2022-07-22 22:34:37,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (1/1) ... [2022-07-22 22:34:37,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (1/1) ... [2022-07-22 22:34:37,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (1/1) ... [2022-07-22 22:34:37,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (1/1) ... [2022-07-22 22:34:37,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (1/1) ... [2022-07-22 22:34:38,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:34:38,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:34:38,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:34:38,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:34:38,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (1/1) ... [2022-07-22 22:34:38,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:34:38,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:38,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 22:34:38,076 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-22 22:34:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-22 22:34:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-22 22:34:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:34:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-22 22:34:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-22 22:34:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-07-22 22:34:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-22 22:34:38,099 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-22 22:34:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-22 22:34:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-22 22:34:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:34:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-22 22:34:38,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-22 22:34:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-22 22:34:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-22 22:34:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:34:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:34:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:34:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:34:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:34:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:34:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:34:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:34:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:34:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-22 22:34:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 22:34:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-22 22:34:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-22 22:34:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:34:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:34:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-07-22 22:34:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-07-22 22:34:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:34:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-22 22:34:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-22 22:34:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-07-22 22:34:38,107 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-07-22 22:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-22 22:34:38,107 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-22 22:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-22 22:34:38,107 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-22 22:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-22 22:34:38,107 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-22 22:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-07-22 22:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:34:38,400 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:34:38,402 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:34:38,599 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-07-22 22:34:39,431 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:34:39,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:34:39,443 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 22:34:39,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:39 BoogieIcfgContainer [2022-07-22 22:34:39,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:34:39,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:34:39,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:34:39,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:34:39,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:34:35" (1/3) ... [2022-07-22 22:34:39,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420cb50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:34:39, skipping insertion in model container [2022-07-22 22:34:39,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:37" (2/3) ... [2022-07-22 22:34:39,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420cb50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:34:39, skipping insertion in model container [2022-07-22 22:34:39,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:39" (3/3) ... [2022-07-22 22:34:39,456 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2022-07-22 22:34:39,468 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:34:39,468 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:34:39,509 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:34:39,514 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@2347c933, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@372b146c [2022-07-22 22:34:39,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:34:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-22 22:34:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 22:34:39,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:39,528 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:34:39,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:39,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash -555983859, now seen corresponding path program 1 times [2022-07-22 22:34:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:39,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751517966] [2022-07-22 22:34:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:34:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:34:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-22 22:34:40,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:40,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751517966] [2022-07-22 22:34:40,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751517966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:40,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:40,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 22:34:40,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195664860] [2022-07-22 22:34:40,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:40,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:34:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:40,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:34:40,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:34:40,353 INFO L87 Difference]: Start difference. First operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-22 22:34:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:40,796 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2022-07-22 22:34:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:34:40,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2022-07-22 22:34:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:40,826 INFO L225 Difference]: With dead ends: 283 [2022-07-22 22:34:40,831 INFO L226 Difference]: Without dead ends: 147 [2022-07-22 22:34:40,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:34:40,842 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 99 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:40,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 198 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:34:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-22 22:34:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-07-22 22:34:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.15) internal successors, (92), 81 states have internal predecessors, (92), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-07-22 22:34:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-07-22 22:34:40,903 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 74 [2022-07-22 22:34:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:40,903 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-07-22 22:34:40,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-22 22:34:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-07-22 22:34:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 22:34:40,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:40,907 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:34:40,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:34:40,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1001240943, now seen corresponding path program 1 times [2022-07-22 22:34:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:40,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541292404] [2022-07-22 22:34:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:40,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:34:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:34:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-22 22:34:41,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:41,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541292404] [2022-07-22 22:34:41,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541292404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:41,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:41,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:34:41,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83478162] [2022-07-22 22:34:41,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:41,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:34:41,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:41,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:34:41,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:34:41,334 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-22 22:34:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:42,060 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2022-07-22 22:34:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:34:42,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2022-07-22 22:34:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:42,062 INFO L225 Difference]: With dead ends: 196 [2022-07-22 22:34:42,062 INFO L226 Difference]: Without dead ends: 152 [2022-07-22 22:34:42,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:34:42,064 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 101 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:42,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 382 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 22:34:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-22 22:34:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2022-07-22 22:34:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 85 states have internal predecessors, (96), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2022-07-22 22:34:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-07-22 22:34:42,086 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 74 [2022-07-22 22:34:42,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:42,086 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-07-22 22:34:42,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-22 22:34:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-07-22 22:34:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-22 22:34:42,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:42,088 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:34:42,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 22:34:42,088 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1994019405, now seen corresponding path program 1 times [2022-07-22 22:34:42,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:42,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696170663] [2022-07-22 22:34:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:34:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:34:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-22 22:34:42,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:42,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696170663] [2022-07-22 22:34:42,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696170663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:42,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:42,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:34:42,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84905501] [2022-07-22 22:34:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:42,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:34:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:42,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:34:42,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:34:42,488 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-22 22:34:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:43,344 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2022-07-22 22:34:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:34:43,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 80 [2022-07-22 22:34:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:43,354 INFO L225 Difference]: With dead ends: 217 [2022-07-22 22:34:43,354 INFO L226 Difference]: Without dead ends: 178 [2022-07-22 22:34:43,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:34:43,361 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 180 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:43,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 470 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-22 22:34:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-22 22:34:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 140. [2022-07-22 22:34:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 89 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 35 states have call predecessors, (35), 33 states have call successors, (35) [2022-07-22 22:34:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2022-07-22 22:34:43,377 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 80 [2022-07-22 22:34:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:43,377 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2022-07-22 22:34:43,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-22 22:34:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2022-07-22 22:34:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-22 22:34:43,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:43,379 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:34:43,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 22:34:43,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1920697878, now seen corresponding path program 1 times [2022-07-22 22:34:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:43,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220314098] [2022-07-22 22:34:43,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:34:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:34:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-22 22:34:43,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:43,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220314098] [2022-07-22 22:34:43,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220314098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:43,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:43,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:34:43,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355245414] [2022-07-22 22:34:43,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:43,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:34:43,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:43,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:34:43,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:34:43,864 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 22:34:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:45,048 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2022-07-22 22:34:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 22:34:45,048 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 82 [2022-07-22 22:34:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:45,050 INFO L225 Difference]: With dead ends: 178 [2022-07-22 22:34:45,051 INFO L226 Difference]: Without dead ends: 161 [2022-07-22 22:34:45,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:34:45,052 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 185 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:45,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 744 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-22 22:34:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-22 22:34:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2022-07-22 22:34:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 78 states have internal predecessors, (86), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-22 22:34:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2022-07-22 22:34:45,067 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 82 [2022-07-22 22:34:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:45,068 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2022-07-22 22:34:45,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 22:34:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2022-07-22 22:34:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-22 22:34:45,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:45,070 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:45,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:34:45,071 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash -870191708, now seen corresponding path program 1 times [2022-07-22 22:34:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:45,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545872183] [2022-07-22 22:34:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:34:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:34:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:34:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 22:34:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:34:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:34:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 22:34:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-22 22:34:45,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:45,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545872183] [2022-07-22 22:34:45,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545872183] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:45,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:45,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:34:45,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132868464] [2022-07-22 22:34:45,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:45,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:34:45,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:45,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:34:45,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:34:45,528 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-22 22:34:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:46,353 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2022-07-22 22:34:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:34:46,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2022-07-22 22:34:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:46,355 INFO L225 Difference]: With dead ends: 206 [2022-07-22 22:34:46,355 INFO L226 Difference]: Without dead ends: 151 [2022-07-22 22:34:46,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:34:46,356 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 159 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:46,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 464 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 22:34:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-22 22:34:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-07-22 22:34:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 82 states have internal predecessors, (90), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-07-22 22:34:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-07-22 22:34:46,370 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 123 [2022-07-22 22:34:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:46,371 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-07-22 22:34:46,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-22 22:34:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-07-22 22:34:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-22 22:34:46,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:46,373 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:46,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 22:34:46,373 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1724885987, now seen corresponding path program 1 times [2022-07-22 22:34:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:46,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586647840] [2022-07-22 22:34:46,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:34:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:34:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:34:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 22:34:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:34:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 22:34:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 22:34:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-22 22:34:46,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:46,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586647840] [2022-07-22 22:34:46,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586647840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:46,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:46,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 22:34:46,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194328028] [2022-07-22 22:34:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:46,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:34:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:46,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:34:46,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:34:46,774 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-22 22:34:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:47,734 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2022-07-22 22:34:47,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 22:34:47,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2022-07-22 22:34:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:47,736 INFO L225 Difference]: With dead ends: 212 [2022-07-22 22:34:47,736 INFO L226 Difference]: Without dead ends: 143 [2022-07-22 22:34:47,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:34:47,737 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 276 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:47,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 466 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-22 22:34:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-22 22:34:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-07-22 22:34:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-22 22:34:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-07-22 22:34:47,747 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 129 [2022-07-22 22:34:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:47,747 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-07-22 22:34:47,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-22 22:34:47,748 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-07-22 22:34:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 22:34:47,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:47,749 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:47,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 22:34:47,750 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:47,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1745997560, now seen corresponding path program 1 times [2022-07-22 22:34:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:47,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328287729] [2022-07-22 22:34:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:34:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:34:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:34:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 22:34:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:34:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 22:34:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:34:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-22 22:34:48,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:48,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328287729] [2022-07-22 22:34:48,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328287729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:48,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:48,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-22 22:34:48,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150079090] [2022-07-22 22:34:48,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:48,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 22:34:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 22:34:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:34:48,695 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-22 22:34:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:50,800 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2022-07-22 22:34:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 22:34:50,801 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 134 [2022-07-22 22:34:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:50,802 INFO L225 Difference]: With dead ends: 190 [2022-07-22 22:34:50,803 INFO L226 Difference]: Without dead ends: 143 [2022-07-22 22:34:50,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 22:34:50,804 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 87 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:50,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1084 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-22 22:34:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-22 22:34:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-07-22 22:34:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 88 states have internal predecessors, (93), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-07-22 22:34:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2022-07-22 22:34:50,815 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 134 [2022-07-22 22:34:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:50,816 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2022-07-22 22:34:50,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-22 22:34:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2022-07-22 22:34:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-22 22:34:50,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:50,818 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:50,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 22:34:50,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1524709556, now seen corresponding path program 1 times [2022-07-22 22:34:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:50,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408875240] [2022-07-22 22:34:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:50,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:50,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:50,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:50,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:34:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:34:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:34:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 22:34:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:34:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 22:34:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 22:34:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-22 22:34:51,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:51,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408875240] [2022-07-22 22:34:51,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408875240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:51,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:51,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 22:34:51,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116273519] [2022-07-22 22:34:51,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:51,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 22:34:51,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:51,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 22:34:51,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:34:51,204 INFO L87 Difference]: Start difference. First operand 137 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-22 22:34:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:52,052 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2022-07-22 22:34:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:34:52,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2022-07-22 22:34:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:52,054 INFO L225 Difference]: With dead ends: 225 [2022-07-22 22:34:52,054 INFO L226 Difference]: Without dead ends: 119 [2022-07-22 22:34:52,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:34:52,055 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 91 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:52,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 478 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 22:34:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-22 22:34:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-22 22:34:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.082191780821918) internal successors, (79), 74 states have internal predecessors, (79), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-22 22:34:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-07-22 22:34:52,065 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 140 [2022-07-22 22:34:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:52,065 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-07-22 22:34:52,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-22 22:34:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-07-22 22:34:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 22:34:52,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:52,067 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:52,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 22:34:52,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1517224244, now seen corresponding path program 1 times [2022-07-22 22:34:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:52,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434058361] [2022-07-22 22:34:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:34:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:34:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:34:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 22:34:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:34:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 22:34:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-22 22:34:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-22 22:34:52,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:52,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434058361] [2022-07-22 22:34:52,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434058361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:52,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:52,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:34:52,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576186881] [2022-07-22 22:34:52,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:52,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:34:52,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:52,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:34:52,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:34:52,539 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-22 22:34:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:53,205 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-07-22 22:34:53,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:34:53,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2022-07-22 22:34:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:53,206 INFO L225 Difference]: With dead ends: 166 [2022-07-22 22:34:53,206 INFO L226 Difference]: Without dead ends: 120 [2022-07-22 22:34:53,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:34:53,207 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:53,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 22:34:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-22 22:34:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-22 22:34:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-22 22:34:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2022-07-22 22:34:53,218 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 135 [2022-07-22 22:34:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:53,219 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-07-22 22:34:53,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-22 22:34:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-07-22 22:34:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-22 22:34:53,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:53,221 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:53,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 22:34:53,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash -473758278, now seen corresponding path program 1 times [2022-07-22 22:34:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:53,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422012982] [2022-07-22 22:34:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:53,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:34:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:34:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:34:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 22:34:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:34:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:53,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:54,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 22:34:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 22:34:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-22 22:34:54,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:54,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422012982] [2022-07-22 22:34:54,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422012982] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:54,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751434356] [2022-07-22 22:34:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:54,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:54,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:54,242 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-22 22:34:54,279 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-22 22:34:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:54,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-22 22:34:54,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:55,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:35:00,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:35:00,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:35:00,759 INFO L356 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-07-22 22:35:00,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 33 [2022-07-22 22:35:00,864 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-22 22:35:00,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-07-22 22:35:01,699 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-22 22:35:01,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-07-22 22:35:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-22 22:35:01,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:35:17,862 WARN L233 SmtUtils]: Spent 14.06s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:35:17,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751434356] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:35:17,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:35:17,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 57 [2022-07-22 22:35:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946464363] [2022-07-22 22:35:17,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:35:17,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-22 22:35:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:17,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-22 22:35:17,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=4118, Unknown=3, NotChecked=0, Total=4290 [2022-07-22 22:35:17,868 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-22 22:35:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:35:23,694 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-07-22 22:35:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-22 22:35:23,694 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 136 [2022-07-22 22:35:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:35:23,695 INFO L225 Difference]: With dead ends: 174 [2022-07-22 22:35:23,696 INFO L226 Difference]: Without dead ends: 123 [2022-07-22 22:35:23,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=464, Invalid=9039, Unknown=3, NotChecked=0, Total=9506 [2022-07-22 22:35:23,699 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 223 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 4139 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 4605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 4139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:35:23,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1414 Invalid, 4605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 4139 Invalid, 0 Unknown, 221 Unchecked, 3.4s Time] [2022-07-22 22:35:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-22 22:35:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-07-22 22:35:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-22 22:35:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-07-22 22:35:23,709 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 136 [2022-07-22 22:35:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:35:23,710 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-07-22 22:35:23,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-22 22:35:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-07-22 22:35:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 22:35:23,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:35:23,712 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:35:23,738 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-22 22:35:23,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 22:35:23,927 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:35:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:35:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1103785842, now seen corresponding path program 2 times [2022-07-22 22:35:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:35:23,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591789695] [2022-07-22 22:35:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:35:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:35:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:35:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:35:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:35:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:35:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:35:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:35:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:35:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:35:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:35:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:35:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 22:35:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:35:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:35:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:35:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:35:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:24,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 22:35:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:25,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-22 22:35:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:35:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-22 22:35:25,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:35:25,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591789695] [2022-07-22 22:35:25,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591789695] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:35:25,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108812534] [2022-07-22 22:35:25,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 22:35:25,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:35:25,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:35:25,143 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-22 22:35:25,145 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-22 22:35:26,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 22:35:26,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:35:26,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 3065 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-22 22:35:26,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:35:26,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:35:29,369 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1327_10| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_11| Int) (v_ArrVal_1286 Int) (v_ArrVal_1289 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_10| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1286) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_11| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1289))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_10| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_11|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1327_10|))) is different from true [2022-07-22 22:35:35,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:35:35,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:35:35,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:35:36,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:35:36,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:35:36,014 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-22 22:35:36,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 42 [2022-07-22 22:35:36,094 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-22 22:35:36,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-07-22 22:35:36,846 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-22 22:35:36,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-07-22 22:35:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 2 not checked. [2022-07-22 22:35:36,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:35:52,869 WARN L233 SmtUtils]: Spent 14.06s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:35:52,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108812534] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:35:52,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:35:52,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 50 [2022-07-22 22:35:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871786669] [2022-07-22 22:35:52,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:35:52,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-22 22:35:52,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:35:52,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-22 22:35:52,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=3164, Unknown=3, NotChecked=112, Total=3422 [2022-07-22 22:35:52,873 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-22 22:36:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:36:07,484 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2022-07-22 22:36:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-22 22:36:07,485 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 137 [2022-07-22 22:36:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:36:07,486 INFO L225 Difference]: With dead ends: 173 [2022-07-22 22:36:07,486 INFO L226 Difference]: Without dead ends: 122 [2022-07-22 22:36:07,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=332, Invalid=6805, Unknown=7, NotChecked=166, Total=7310 [2022-07-22 22:36:07,489 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 101 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 3968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 901 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:36:07,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1650 Invalid, 3968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2956 Invalid, 0 Unknown, 901 Unchecked, 2.4s Time] [2022-07-22 22:36:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-22 22:36:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-22 22:36:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 77 states have internal predecessors, (82), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-22 22:36:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-07-22 22:36:07,498 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 137 [2022-07-22 22:36:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:36:07,499 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-07-22 22:36:07,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-22 22:36:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-07-22 22:36:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-22 22:36:07,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:36:07,501 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:36:07,535 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-22 22:36:07,723 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,SelfDestructingSolverStorable10 [2022-07-22 22:36:07,724 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:36:07,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:36:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash 840196154, now seen corresponding path program 3 times [2022-07-22 22:36:07,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:36:07,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762591252] [2022-07-22 22:36:07,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:36:07,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:36:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:36:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:36:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:36:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:36:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:36:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:36:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:36:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:36:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:36:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 22:36:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:36:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:36:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:36:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 22:36:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 22:36:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-22 22:36:08,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:36:08,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762591252] [2022-07-22 22:36:08,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762591252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:36:08,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063903046] [2022-07-22 22:36:08,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 22:36:08,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:36:08,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:36:08,894 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-22 22:36:08,895 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-22 22:36:15,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 22:36:15,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:36:15,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-22 22:36:15,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:36:16,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:36:25,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:36:25,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:36:25,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:36:25,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:36:25,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:36:25,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:36:25,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-07-22 22:36:25,408 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-22 22:36:25,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-07-22 22:36:26,168 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-22 22:36:26,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-07-22 22:36:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-22 22:36:26,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:36:28,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063903046] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:36:28,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:36:28,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 52 [2022-07-22 22:36:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025083071] [2022-07-22 22:36:28,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:36:28,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-22 22:36:28,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:36:28,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-22 22:36:28,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3507, Unknown=2, NotChecked=0, Total=3660 [2022-07-22 22:36:28,338 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-22 22:36:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:36:43,381 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2022-07-22 22:36:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-22 22:36:43,381 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 138 [2022-07-22 22:36:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:36:43,382 INFO L225 Difference]: With dead ends: 175 [2022-07-22 22:36:43,382 INFO L226 Difference]: Without dead ends: 124 [2022-07-22 22:36:43,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=341, Invalid=7311, Unknown=4, NotChecked=0, Total=7656 [2022-07-22 22:36:43,385 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 127 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 2870 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 653 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:36:43,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1674 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2870 Invalid, 0 Unknown, 653 Unchecked, 2.4s Time] [2022-07-22 22:36:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-22 22:36:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-22 22:36:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-22 22:36:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2022-07-22 22:36:43,396 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 138 [2022-07-22 22:36:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:36:43,396 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2022-07-22 22:36:43,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-22 22:36:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2022-07-22 22:36:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-22 22:36:43,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:36:43,398 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:36:43,416 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-22 22:36:43,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:36:43,612 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:36:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:36:43,612 INFO L85 PathProgramCache]: Analyzing trace with hash 974095886, now seen corresponding path program 4 times [2022-07-22 22:36:43,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:36:43,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268175966] [2022-07-22 22:36:43,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:36:43,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:36:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:36:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:36:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:36:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:36:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:36:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:36:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:36:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:36:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:36:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:36:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 22:36:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:36:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:36:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:36:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:36:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 22:36:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 22:36:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:36:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-07-22 22:36:44,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:36:44,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268175966] [2022-07-22 22:36:44,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268175966] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:36:44,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371076096] [2022-07-22 22:36:44,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 22:36:44,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:36:44,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:36:44,902 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-22 22:36:44,904 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-22 22:36:46,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 22:36:46,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:36:46,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 3327 conjuncts, 157 conjunts are in the unsatisfiable core [2022-07-22 22:36:46,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:36:47,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:37:16,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:16,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:16,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:16,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:16,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:16,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:16,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:16,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:16,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:16,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:37:16,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2022-07-22 22:37:16,477 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-22 22:37:16,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-07-22 22:37:17,492 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-07-22 22:37:17,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-07-22 22:37:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 14 refuted. 3 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-22 22:37:17,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:37:35,348 WARN L233 SmtUtils]: Spent 14.21s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:37:35,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371076096] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:37:35,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:37:35,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 43] total 66 [2022-07-22 22:37:35,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813215438] [2022-07-22 22:37:35,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:37:35,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-22 22:37:35,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:37:35,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-22 22:37:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=5357, Unknown=11, NotChecked=0, Total=5550 [2022-07-22 22:37:35,353 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 66 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 49 states have internal predecessors, (121), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-07-22 22:38:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:18,245 INFO L93 Difference]: Finished difference Result 178 states and 211 transitions. [2022-07-22 22:38:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-22 22:38:18,246 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 49 states have internal predecessors, (121), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) Word has length 139 [2022-07-22 22:38:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:18,247 INFO L225 Difference]: With dead ends: 178 [2022-07-22 22:38:18,247 INFO L226 Difference]: Without dead ends: 127 [2022-07-22 22:38:18,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2077 ImplicationChecksByTransitivity, 86.0s TimeCoverageRelationStatistics Valid=501, Invalid=12588, Unknown=21, NotChecked=0, Total=13110 [2022-07-22 22:38:18,251 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 129 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 4189 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 5272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 4189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 937 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:18,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1701 Invalid, 5272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 4189 Invalid, 0 Unknown, 937 Unchecked, 3.8s Time] [2022-07-22 22:38:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-22 22:38:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-22 22:38:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 79 states have internal predecessors, (84), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-22 22:38:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2022-07-22 22:38:18,264 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 139 [2022-07-22 22:38:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:18,265 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2022-07-22 22:38:18,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 49 states have internal predecessors, (121), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-07-22 22:38:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2022-07-22 22:38:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-22 22:38:18,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:18,267 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:38:18,303 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-22 22:38:18,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:18,479 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash 830020282, now seen corresponding path program 5 times [2022-07-22 22:38:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:18,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635143666] [2022-07-22 22:38:18,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:18,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:38:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:38:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:38:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:38:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:38:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:38:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:38:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:38:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 22:38:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 22:38:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:38:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:38:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:38:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:38:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:19,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 22:38:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:20,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 22:38:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-22 22:38:20,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:20,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635143666] [2022-07-22 22:38:20,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635143666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:20,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158864283] [2022-07-22 22:38:20,551 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 22:38:20,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:20,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:20,552 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-22 22:38:20,562 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-22 22:38:35,802 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-22 22:38:35,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:38:35,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 3458 conjuncts, 267 conjunts are in the unsatisfiable core [2022-07-22 22:38:35,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:35,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 22:38:36,889 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 22:38:36,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-22 22:38:36,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 22:38:37,135 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 22:38:37,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-22 22:38:38,181 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 22:38:38,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-22 22:38:38,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:38:38,628 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3903 Int) (v_ArrVal_3899 (Array Int Int)) (|v_#Ultimate.C_memcpy_#t~loopctr1327_48| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| 1) |c_#Ultimate.C_memcpy_#t~loopctr1327|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3899) |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|)) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3903)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1327_48|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-07-22 22:38:38,656 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_3903 Int) (v_ArrVal_3910 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_49| Int) (v_ArrVal_3899 (Array Int Int)) (|v_#Ultimate.C_memcpy_#t~loopctr1327_48| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3899) |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|)) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3903) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3910)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_49|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| 1) |c_#Ultimate.C_memcpy_#t~loopctr1327|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1327_48|)))) is different from true [2022-07-22 22:38:38,717 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3903 Int) (v_ArrVal_3910 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_50| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_49| Int) (v_ArrVal_3899 (Array Int Int)) (|v_#Ultimate.C_memcpy_#t~loopctr1327_48| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3899) |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|)) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3903) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3910) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_50| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3915) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| |v_#Ultimate.C_memcpy_#t~loopctr1327_50|)))) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_50| 1) |c_#Ultimate.C_memcpy_#t~loopctr1327|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_50|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_49|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1327_48|)))) is different from true [2022-07-22 22:38:38,828 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_3915 (Array Int Int)) (|#Ultimate.C_memcpy_src.offset| Int) (v_ArrVal_3903 Int) (v_ArrVal_3929 (Array Int Int)) (v_ArrVal_3910 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_51_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_50| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_49| Int) (v_ArrVal_3899 (Array Int Int)) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1327_51_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1327_48| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1327_51_67|))) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3899) |c_#Ultimate.C_memcpy_src.base|) |#Ultimate.C_memcpy_src.offset|)) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3903) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3910) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_50| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3915) |c_#Ultimate.C_memcpy_src.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_50| |#Ultimate.C_memcpy_src.offset|))) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_51_67|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_3929) |c_#Ultimate.C_memcpy_src.base|) (+ .cse0 |#Ultimate.C_memcpy_src.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_51_67|)))) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_49| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_50|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1327_49|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_51_67|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_51_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1327_50| 1) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1327_51_67|)) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1327_48|))))) is different from true [2022-07-22 22:38:40,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,113 INFO L356 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-07-22 22:38:40,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 87 [2022-07-22 22:38:40,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,411 INFO L356 Elim1Store]: treesize reduction 75, result has 38.0 percent of original size [2022-07-22 22:38:40,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 99