./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_compare_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 66fb9bfec5c458b51d86deb6748dd65f162e7ac6a772af5f3fec59d101a18d8d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:57:43,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:57:43,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:57:43,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:57:43,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:57:43,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:57:43,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:57:43,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:57:43,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:57:43,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:57:43,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:57:43,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:57:43,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:57:43,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:57:43,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:57:43,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:57:43,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:57:43,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:57:43,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:57:43,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:57:43,254 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:57:43,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:57:43,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:57:43,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:57:43,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:57:43,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:57:43,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:57:43,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:57:43,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:57:43,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:57:43,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:57:43,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:57:43,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:57:43,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:57:43,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:57:43,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:57:43,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:57:43,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:57:43,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:57:43,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:57:43,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:57:43,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:57:43,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:57:43,295 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:57:43,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:57:43,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:57:43,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:57:43,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:57:43,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:57:43,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:57:43,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:57:43,301 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:57:43,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:57:43,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:57:43,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:57:43,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:57:43,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:57:43,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:57:43,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:57:43,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:57:43,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:57:43,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:57:43,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:57:43,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:57:43,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:57:43,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:57:43,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:57:43,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:57:43,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:57:43,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:57:43,305 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:57:43,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:57:43,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:57:43,305 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 -> 66fb9bfec5c458b51d86deb6748dd65f162e7ac6a772af5f3fec59d101a18d8d [2022-07-13 22:57:43,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:57:43,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:57:43,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:57:43,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:57:43,520 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:57:43,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i [2022-07-13 22:57:43,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c1758ae/61c7bbd38e174b4e87829a146b52ce30/FLAG3d4d17c19 [2022-07-13 22:57:44,180 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:57:44,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i [2022-07-13 22:57:44,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c1758ae/61c7bbd38e174b4e87829a146b52ce30/FLAG3d4d17c19 [2022-07-13 22:57:44,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c1758ae/61c7bbd38e174b4e87829a146b52ce30 [2022-07-13 22:57:44,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:57:44,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:57:44,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:57:44,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:57:44,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:57:44,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:57:44" (1/1) ... [2022-07-13 22:57:44,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85042b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:44, skipping insertion in model container [2022-07-13 22:57:44,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:57:44" (1/1) ... [2022-07-13 22:57:44,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:57:44,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:57:44,890 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_compare_harness.i[4492,4505] [2022-07-13 22:57:44,897 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_compare_harness.i[4552,4565] [2022-07-13 22:57:45,502 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,503 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,503 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,504 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,506 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,527 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,530 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,530 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,531 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,748 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:57:45,749 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:57:45,750 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:57:45,751 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:57:45,751 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:57:45,752 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:57:45,752 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:57:45,752 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:57:45,753 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:57:45,753 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:57:45,826 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:57:45,896 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,897 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:45,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:57:46,032 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:57:46,047 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_compare_harness.i[4492,4505] [2022-07-13 22:57:46,047 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_compare_harness.i[4552,4565] [2022-07-13 22:57:46,073 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,077 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,078 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,078 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,078 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,093 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:57:46,094 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:57:46,094 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:57:46,094 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:57:46,095 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:57:46,095 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:57:46,095 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:57:46,096 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:57:46,096 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:57:46,096 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:57:46,106 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:57:46,161 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,163 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:46,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:57:46,348 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:57:46,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46 WrapperNode [2022-07-13 22:57:46,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:57:46,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:57:46,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:57:46,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:57:46,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (1/1) ... [2022-07-13 22:57:46,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (1/1) ... [2022-07-13 22:57:46,510 INFO L137 Inliner]: procedures = 693, calls = 2780, calls flagged for inlining = 57, calls inlined = 5, statements flattened = 822 [2022-07-13 22:57:46,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:57:46,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:57:46,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:57:46,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:57:46,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (1/1) ... [2022-07-13 22:57:46,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (1/1) ... [2022-07-13 22:57:46,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (1/1) ... [2022-07-13 22:57:46,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (1/1) ... [2022-07-13 22:57:46,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (1/1) ... [2022-07-13 22:57:46,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (1/1) ... [2022-07-13 22:57:46,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (1/1) ... [2022-07-13 22:57:46,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:57:46,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:57:46,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:57:46,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:57:46,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (1/1) ... [2022-07-13 22:57:46,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:57:46,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:57:46,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 22:57:46,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 22:57:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-13 22:57:46,640 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-13 22:57:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_compare [2022-07-13 22:57:46,640 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_compare [2022-07-13 22:57:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:57:46,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:57:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 22:57:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:57:46,641 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:57:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:57:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:57:46,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:57:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:57:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:57:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:57:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:57:46,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:57:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:57:46,644 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:57:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 22:57:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2022-07-13 22:57:46,644 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2022-07-13 22:57:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:57:46,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:57:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:57:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:57:46,645 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:57:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:57:46,645 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:57:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:57:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:57:46,866 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:57:46,875 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:57:47,618 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:57:47,624 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:57:47,625 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:57:47,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:57:47 BoogieIcfgContainer [2022-07-13 22:57:47,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:57:47,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:57:47,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:57:47,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:57:47,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:57:44" (1/3) ... [2022-07-13 22:57:47,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd4071a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:57:47, skipping insertion in model container [2022-07-13 22:57:47,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:46" (2/3) ... [2022-07-13 22:57:47,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd4071a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:57:47, skipping insertion in model container [2022-07-13 22:57:47,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:57:47" (3/3) ... [2022-07-13 22:57:47,634 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_compare_harness.i [2022-07-13 22:57:47,646 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:57:47,646 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:57:47,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:57:47,697 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@17b40cb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4bdbb39f [2022-07-13 22:57:47,697 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:57:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 80 states have (on average 1.3) internal successors, (104), 81 states have internal predecessors, (104), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-07-13 22:57:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 22:57:47,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:57:47,710 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:57:47,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:57:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:57:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1023392938, now seen corresponding path program 1 times [2022-07-13 22:57:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:57:47,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985061413] [2022-07-13 22:57:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:47,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:57:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:57:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:57:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:57:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:57:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:57:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:57:48,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:57:48,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985061413] [2022-07-13 22:57:48,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985061413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:57:48,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:57:48,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:57:48,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141815964] [2022-07-13 22:57:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:57:48,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:57:48,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:57:48,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:57:48,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:57:48,255 INFO L87 Difference]: Start difference. First operand has 125 states, 80 states have (on average 1.3) internal successors, (104), 81 states have internal predecessors, (104), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 22:57:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:57:48,286 INFO L93 Difference]: Finished difference Result 245 states and 350 transitions. [2022-07-13 22:57:48,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:57:48,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2022-07-13 22:57:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:57:48,294 INFO L225 Difference]: With dead ends: 245 [2022-07-13 22:57:48,294 INFO L226 Difference]: Without dead ends: 120 [2022-07-13 22:57:48,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:57:48,305 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:57:48,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:57:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-13 22:57:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-13 22:57:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 77 states have internal predecessors, (97), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 22:57:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions. [2022-07-13 22:57:48,349 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 52 [2022-07-13 22:57:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:57:48,350 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions. [2022-07-13 22:57:48,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 22:57:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions. [2022-07-13 22:57:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 22:57:48,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:57:48,355 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:57:48,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:57:48,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:57:48,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:57:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1611808362, now seen corresponding path program 1 times [2022-07-13 22:57:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:57:48,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87762972] [2022-07-13 22:57:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:57:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:57:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:57:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:57:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:57:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:57:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:57:48,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:57:48,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87762972] [2022-07-13 22:57:48,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87762972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:57:48,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:57:48,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:57:48,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181489405] [2022-07-13 22:57:48,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:57:48,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:57:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:57:48,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:57:48,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:57:48,616 INFO L87 Difference]: Start difference. First operand 120 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 22:57:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:57:48,672 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2022-07-13 22:57:48,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:57:48,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2022-07-13 22:57:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:57:48,674 INFO L225 Difference]: With dead ends: 176 [2022-07-13 22:57:48,674 INFO L226 Difference]: Without dead ends: 140 [2022-07-13 22:57:48,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:57:48,675 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 8 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:57:48,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 474 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:57:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-13 22:57:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2022-07-13 22:57:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-13 22:57:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 188 transitions. [2022-07-13 22:57:48,687 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 188 transitions. Word has length 52 [2022-07-13 22:57:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:57:48,687 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 188 transitions. [2022-07-13 22:57:48,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 22:57:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 188 transitions. [2022-07-13 22:57:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 22:57:48,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:57:48,694 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:57:48,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:57:48,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:57:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:57:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1339119567, now seen corresponding path program 1 times [2022-07-13 22:57:48,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:57:48,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613960818] [2022-07-13 22:57:48,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:48,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:57:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:57:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:57:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:57:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:57:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:57:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:57:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:57:48,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:57:48,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613960818] [2022-07-13 22:57:48,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613960818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:57:48,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:57:48,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:57:48,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705566788] [2022-07-13 22:57:48,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:57:48,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:57:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:57:48,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:57:48,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:57:48,908 INFO L87 Difference]: Start difference. First operand 137 states and 188 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:57:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:57:48,935 INFO L93 Difference]: Finished difference Result 164 states and 222 transitions. [2022-07-13 22:57:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:57:48,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-07-13 22:57:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:57:48,939 INFO L225 Difference]: With dead ends: 164 [2022-07-13 22:57:48,940 INFO L226 Difference]: Without dead ends: 143 [2022-07-13 22:57:48,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:57:48,942 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:57:48,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:57:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-13 22:57:48,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-07-13 22:57:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 93 states have internal predecessors, (118), 38 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (39), 39 states have call predecessors, (39), 37 states have call successors, (39) [2022-07-13 22:57:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 195 transitions. [2022-07-13 22:57:48,966 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 195 transitions. Word has length 61 [2022-07-13 22:57:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:57:48,967 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 195 transitions. [2022-07-13 22:57:48,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:57:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 195 transitions. [2022-07-13 22:57:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 22:57:48,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:57:48,969 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:57:48,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:57:48,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:57:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:57:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 911301910, now seen corresponding path program 1 times [2022-07-13 22:57:48,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:57:48,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23918831] [2022-07-13 22:57:48,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:57:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:57:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:57:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:57:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:57:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:57:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:57:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:57:49,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:57:49,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23918831] [2022-07-13 22:57:49,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23918831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:57:49,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:57:49,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:57:49,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906448415] [2022-07-13 22:57:49,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:57:49,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:57:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:57:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:57:49,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:57:49,173 INFO L87 Difference]: Start difference. First operand 143 states and 195 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 22:57:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:57:49,214 INFO L93 Difference]: Finished difference Result 207 states and 280 transitions. [2022-07-13 22:57:49,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:57:49,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-07-13 22:57:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:57:49,216 INFO L225 Difference]: With dead ends: 207 [2022-07-13 22:57:49,217 INFO L226 Difference]: Without dead ends: 163 [2022-07-13 22:57:49,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:57:49,218 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 5 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:57:49,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 649 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:57:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-13 22:57:49,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-07-13 22:57:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 107 states have (on average 1.2616822429906542) internal successors, (135), 108 states have internal predecessors, (135), 44 states have call successors, (44), 10 states have call predecessors, (44), 11 states have return successors, (44), 44 states have call predecessors, (44), 41 states have call successors, (44) [2022-07-13 22:57:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 223 transitions. [2022-07-13 22:57:49,226 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 223 transitions. Word has length 62 [2022-07-13 22:57:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:57:49,227 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 223 transitions. [2022-07-13 22:57:49,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 22:57:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 223 transitions. [2022-07-13 22:57:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 22:57:49,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:57:49,228 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:57:49,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:57:49,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:57:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:57:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash 17815572, now seen corresponding path program 1 times [2022-07-13 22:57:49,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:57:49,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169356072] [2022-07-13 22:57:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:57:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:57:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:57:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:57:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:57:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:57:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:57:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:57:49,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:57:49,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169356072] [2022-07-13 22:57:49,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169356072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:57:49,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:57:49,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:57:49,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424197189] [2022-07-13 22:57:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:57:49,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:57:49,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:57:49,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:57:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:57:49,412 INFO L87 Difference]: Start difference. First operand 163 states and 223 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 22:57:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:57:49,510 INFO L93 Difference]: Finished difference Result 193 states and 260 transitions. [2022-07-13 22:57:49,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:57:49,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 62 [2022-07-13 22:57:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:57:49,511 INFO L225 Difference]: With dead ends: 193 [2022-07-13 22:57:49,511 INFO L226 Difference]: Without dead ends: 171 [2022-07-13 22:57:49,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:57:49,514 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 29 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:57:49,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 963 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:57:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-13 22:57:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2022-07-13 22:57:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 107 states have internal predecessors, (134), 44 states have call successors, (44), 10 states have call predecessors, (44), 11 states have return successors, (44), 44 states have call predecessors, (44), 41 states have call successors, (44) [2022-07-13 22:57:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 222 transitions. [2022-07-13 22:57:49,525 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 222 transitions. Word has length 62 [2022-07-13 22:57:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:57:49,526 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 222 transitions. [2022-07-13 22:57:49,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 22:57:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 222 transitions. [2022-07-13 22:57:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:57:49,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:57:49,527 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:57:49,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:57:49,528 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:57:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:57:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash -699694359, now seen corresponding path program 1 times [2022-07-13 22:57:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:57:49,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690317057] [2022-07-13 22:57:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:57:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:57:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:57:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:57:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:57:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:57:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:57:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:50,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:57:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:50,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:57:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:50,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:57:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:50,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:57:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:57:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 22:57:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:57:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690317057] [2022-07-13 22:57:50,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690317057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:57:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246705632] [2022-07-13 22:57:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:57:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:57:50,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:57:50,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:57:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:50,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 2584 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-13 22:57:50,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:57:50,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 60 [2022-07-13 22:57:50,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:57:50,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:57:50,795 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-13 22:57:50,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 125 [2022-07-13 22:57:50,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:57:50,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:57:50,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:57:50,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 19 [2022-07-13 22:57:53,085 INFO L356 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-07-13 22:57:53,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 196 treesize of output 121 [2022-07-13 22:57:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:57:53,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:57:54,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-07-13 22:57:54,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:57:54,469 INFO L356 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2022-07-13 22:57:54,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2022-07-13 22:57:54,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-07-13 22:57:54,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:57:54,487 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 22:57:54,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-07-13 22:57:54,503 INFO L356 Elim1Store]: treesize reduction 66, result has 5.7 percent of original size [2022-07-13 22:57:54,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 65 treesize of output 50 [2022-07-13 22:57:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 22:57:54,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246705632] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:57:54,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:57:54,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 25, 18] total 50 [2022-07-13 22:57:54,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029532411] [2022-07-13 22:57:54,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:57:54,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 22:57:54,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:57:54,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 22:57:54,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2299, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 22:57:54,795 INFO L87 Difference]: Start difference. First operand 162 states and 222 transitions. Second operand has 50 states, 44 states have (on average 2.840909090909091) internal successors, (125), 37 states have internal predecessors, (125), 17 states have call successors, (34), 7 states have call predecessors, (34), 12 states have return successors, (32), 20 states have call predecessors, (32), 15 states have call successors, (32) [2022-07-13 22:57:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:57:57,387 INFO L93 Difference]: Finished difference Result 252 states and 349 transitions. [2022-07-13 22:57:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 22:57:57,387 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 44 states have (on average 2.840909090909091) internal successors, (125), 37 states have internal predecessors, (125), 17 states have call successors, (34), 7 states have call predecessors, (34), 12 states have return successors, (32), 20 states have call predecessors, (32), 15 states have call successors, (32) Word has length 90 [2022-07-13 22:57:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:57:57,389 INFO L225 Difference]: With dead ends: 252 [2022-07-13 22:57:57,389 INFO L226 Difference]: Without dead ends: 150 [2022-07-13 22:57:57,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 162 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=300, Invalid=3990, Unknown=0, NotChecked=0, Total=4290 [2022-07-13 22:57:57,391 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 159 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:57:57,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1618 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2730 Invalid, 0 Unknown, 343 Unchecked, 1.7s Time] [2022-07-13 22:57:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-13 22:57:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-07-13 22:57:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 97 states have internal predecessors, (119), 40 states have call successors, (40), 10 states have call predecessors, (40), 11 states have return successors, (39), 39 states have call predecessors, (39), 37 states have call successors, (39) [2022-07-13 22:57:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2022-07-13 22:57:57,398 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 90 [2022-07-13 22:57:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:57:57,398 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2022-07-13 22:57:57,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 44 states have (on average 2.840909090909091) internal successors, (125), 37 states have internal predecessors, (125), 17 states have call successors, (34), 7 states have call predecessors, (34), 12 states have return successors, (32), 20 states have call predecessors, (32), 15 states have call successors, (32) [2022-07-13 22:57:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2022-07-13 22:57:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 22:57:57,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:57:57,400 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:57:57,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 22:57:57,609 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,SelfDestructingSolverStorable5 [2022-07-13 22:57:57,609 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:57:57,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:57:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2005326277, now seen corresponding path program 1 times [2022-07-13 22:57:57,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:57:57,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022839691] [2022-07-13 22:57:57,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:57:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:57:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:57:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:57:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:57:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:57:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:57:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:57:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:57:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:57:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:57:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:57:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:57:57,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:57:57,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022839691] [2022-07-13 22:57:57,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022839691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:57:57,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:57:57,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:57:57,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333415827] [2022-07-13 22:57:57,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:57:57,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:57:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:57:57,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:57:57,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:57:57,800 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 22:57:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:57:58,015 INFO L93 Difference]: Finished difference Result 206 states and 276 transitions. [2022-07-13 22:57:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:57:58,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2022-07-13 22:57:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:57:58,017 INFO L225 Difference]: With dead ends: 206 [2022-07-13 22:57:58,017 INFO L226 Difference]: Without dead ends: 170 [2022-07-13 22:57:58,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:57:58,018 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 63 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:57:58,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 270 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:57:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-13 22:57:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2022-07-13 22:57:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 100 states have (on average 1.25) internal successors, (125), 101 states have internal predecessors, (125), 41 states have call successors, (41), 10 states have call predecessors, (41), 11 states have return successors, (41), 41 states have call predecessors, (41), 38 states have call successors, (41) [2022-07-13 22:57:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions. [2022-07-13 22:57:58,025 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 86 [2022-07-13 22:57:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:57:58,025 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 207 transitions. [2022-07-13 22:57:58,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 22:57:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions. [2022-07-13 22:57:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 22:57:58,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:57:58,030 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:57:58,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:57:58,030 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:57:58,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:57:58,031 INFO L85 PathProgramCache]: Analyzing trace with hash 366412985, now seen corresponding path program 1 times [2022-07-13 22:57:58,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:57:58,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256181803] [2022-07-13 22:57:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:57:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:57:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:57:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:57:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:57:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:57:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:57:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:57:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:57:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:57:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:57:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:57:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 22:57:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:57:58,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256181803] [2022-07-13 22:57:58,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256181803] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:57:58,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352493839] [2022-07-13 22:57:58,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:58,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:57:58,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:57:58,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:57:58,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:57:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:58,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 2586 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 22:57:58,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:57:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:57:59,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:57:59,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352493839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:57:59,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:57:59,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [18] total 30 [2022-07-13 22:57:59,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491002208] [2022-07-13 22:57:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:57:59,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 22:57:59,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:57:59,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 22:57:59,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=806, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:57:59,029 INFO L87 Difference]: Start difference. First operand 153 states and 207 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-13 22:57:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:57:59,409 INFO L93 Difference]: Finished difference Result 235 states and 324 transitions. [2022-07-13 22:57:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:57:59,409 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) Word has length 86 [2022-07-13 22:57:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:57:59,410 INFO L225 Difference]: With dead ends: 235 [2022-07-13 22:57:59,410 INFO L226 Difference]: Without dead ends: 181 [2022-07-13 22:57:59,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 22:57:59,411 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 108 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:57:59,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 2554 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:57:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-13 22:57:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2022-07-13 22:57:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 118 states have internal predecessors, (145), 49 states have call successors, (49), 10 states have call predecessors, (49), 13 states have return successors, (52), 48 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 22:57:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 246 transitions. [2022-07-13 22:57:59,419 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 246 transitions. Word has length 86 [2022-07-13 22:57:59,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:57:59,419 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 246 transitions. [2022-07-13 22:57:59,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 9 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-13 22:57:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 246 transitions. [2022-07-13 22:57:59,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 22:57:59,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:57:59,421 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:57:59,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:57:59,635 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,SelfDestructingSolverStorable7 [2022-07-13 22:57:59,635 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:57:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:57:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash -461925254, now seen corresponding path program 1 times [2022-07-13 22:57:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:57:59,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088466363] [2022-07-13 22:57:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:59,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:57:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:57:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:57:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:57:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:57:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:57:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:57:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:57:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:57:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:57:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:57:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:57:59,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:57:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:58:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 22:58:00,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:00,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088466363] [2022-07-13 22:58:00,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088466363] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:00,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955886718] [2022-07-13 22:58:00,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:00,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:00,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:00,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:00,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:58:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-13 22:58:00,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:58:00,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:00,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955886718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:00,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:00,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [18] total 30 [2022-07-13 22:58:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206363797] [2022-07-13 22:58:00,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:00,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 22:58:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:00,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 22:58:00,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=806, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:58:00,640 INFO L87 Difference]: Start difference. First operand 177 states and 246 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 15 states have internal predecessors, (49), 7 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-13 22:58:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:01,007 INFO L93 Difference]: Finished difference Result 286 states and 404 transitions. [2022-07-13 22:58:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:58:01,008 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 15 states have internal predecessors, (49), 7 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 95 [2022-07-13 22:58:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:01,009 INFO L225 Difference]: With dead ends: 286 [2022-07-13 22:58:01,009 INFO L226 Difference]: Without dead ends: 238 [2022-07-13 22:58:01,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=1374, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 22:58:01,011 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 100 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:01,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 2289 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-13 22:58:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 185. [2022-07-13 22:58:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 123 states have internal predecessors, (152), 52 states have call successors, (52), 10 states have call predecessors, (52), 13 states have return successors, (55), 51 states have call predecessors, (55), 49 states have call successors, (55) [2022-07-13 22:58:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2022-07-13 22:58:01,019 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 95 [2022-07-13 22:58:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:01,020 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2022-07-13 22:58:01,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 15 states have internal predecessors, (49), 7 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-13 22:58:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2022-07-13 22:58:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:58:01,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:01,021 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:01,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:01,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:01,229 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:01,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1611942060, now seen corresponding path program 1 times [2022-07-13 22:58:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:01,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966086174] [2022-07-13 22:58:01,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:01,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:58:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:58:01,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:01,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966086174] [2022-07-13 22:58:01,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966086174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:01,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:01,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:58:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819777472] [2022-07-13 22:58:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:01,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:58:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:58:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:58:01,452 INFO L87 Difference]: Start difference. First operand 185 states and 259 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-13 22:58:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:01,894 INFO L93 Difference]: Finished difference Result 248 states and 336 transitions. [2022-07-13 22:58:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:58:01,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 96 [2022-07-13 22:58:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:01,896 INFO L225 Difference]: With dead ends: 248 [2022-07-13 22:58:01,896 INFO L226 Difference]: Without dead ends: 194 [2022-07-13 22:58:01,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:58:01,897 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 169 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:01,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 476 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:58:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-13 22:58:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 160. [2022-07-13 22:58:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 107 states have internal predecessors, (126), 45 states have call successors, (45), 10 states have call predecessors, (45), 12 states have return successors, (44), 42 states have call predecessors, (44), 42 states have call successors, (44) [2022-07-13 22:58:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 215 transitions. [2022-07-13 22:58:01,905 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 215 transitions. Word has length 96 [2022-07-13 22:58:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:01,906 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 215 transitions. [2022-07-13 22:58:01,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-13 22:58:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 215 transitions. [2022-07-13 22:58:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 22:58:01,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:01,908 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:01,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:58:01,908 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:01,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1579542017, now seen corresponding path program 1 times [2022-07-13 22:58:01,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:01,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477286579] [2022-07-13 22:58:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:01,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:58:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:58:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:58:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 22:58:02,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:02,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477286579] [2022-07-13 22:58:02,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477286579] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:02,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242102381] [2022-07-13 22:58:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:02,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:02,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:02,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:02,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:58:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 2642 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-13 22:58:02,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 22:58:02,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:02,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242102381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:02,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:02,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [13] total 27 [2022-07-13 22:58:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073087570] [2022-07-13 22:58:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:02,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 22:58:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:02,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 22:58:02,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:58:02,890 INFO L87 Difference]: Start difference. First operand 160 states and 215 transitions. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:58:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:03,162 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2022-07-13 22:58:03,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:58:03,163 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 104 [2022-07-13 22:58:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:03,163 INFO L225 Difference]: With dead ends: 173 [2022-07-13 22:58:03,164 INFO L226 Difference]: Without dead ends: 171 [2022-07-13 22:58:03,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 22:58:03,164 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 63 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:03,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2020 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-13 22:58:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2022-07-13 22:58:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 110 states have internal predecessors, (129), 45 states have call successors, (45), 11 states have call predecessors, (45), 13 states have return successors, (44), 42 states have call predecessors, (44), 42 states have call successors, (44) [2022-07-13 22:58:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 218 transitions. [2022-07-13 22:58:03,175 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 218 transitions. Word has length 104 [2022-07-13 22:58:03,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:03,175 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 218 transitions. [2022-07-13 22:58:03,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:58:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2022-07-13 22:58:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 22:58:03,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:03,178 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:03,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:03,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:03,391 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1950030962, now seen corresponding path program 1 times [2022-07-13 22:58:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:03,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024072283] [2022-07-13 22:58:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:03,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:58:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:58:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:58:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:58:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:58:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-13 22:58:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:03,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024072283] [2022-07-13 22:58:03,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024072283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:03,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:03,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:58:03,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629613556] [2022-07-13 22:58:03,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:03,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:58:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:03,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:58:03,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:58:03,642 INFO L87 Difference]: Start difference. First operand 164 states and 218 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 5 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 22:58:04,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:04,128 INFO L93 Difference]: Finished difference Result 252 states and 330 transitions. [2022-07-13 22:58:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:58:04,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 5 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 130 [2022-07-13 22:58:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:04,129 INFO L225 Difference]: With dead ends: 252 [2022-07-13 22:58:04,129 INFO L226 Difference]: Without dead ends: 192 [2022-07-13 22:58:04,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:58:04,130 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 171 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:04,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 517 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:58:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-13 22:58:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2022-07-13 22:58:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 115 states have (on average 1.191304347826087) internal successors, (137), 120 states have internal predecessors, (137), 50 states have call successors, (50), 12 states have call predecessors, (50), 13 states have return successors, (47), 46 states have call predecessors, (47), 46 states have call successors, (47) [2022-07-13 22:58:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2022-07-13 22:58:04,138 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 130 [2022-07-13 22:58:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:04,138 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2022-07-13 22:58:04,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 5 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 22:58:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2022-07-13 22:58:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-13 22:58:04,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:04,139 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:04,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 22:58:04,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:04,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2104696588, now seen corresponding path program 1 times [2022-07-13 22:58:04,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:04,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118383403] [2022-07-13 22:58:04,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:04,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:58:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:58:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:58:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:58:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:58:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-13 22:58:04,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:04,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118383403] [2022-07-13 22:58:04,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118383403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:04,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:04,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:58:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165613411] [2022-07-13 22:58:04,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:04,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:58:04,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:04,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:58:04,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:58:04,361 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 5 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 22:58:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:04,767 INFO L93 Difference]: Finished difference Result 199 states and 253 transitions. [2022-07-13 22:58:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:58:04,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 5 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 130 [2022-07-13 22:58:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:04,768 INFO L225 Difference]: With dead ends: 199 [2022-07-13 22:58:04,768 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 22:58:04,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:58:04,769 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 136 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:04,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 470 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:58:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 22:58:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-07-13 22:58:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 93 states have internal predecessors, (104), 34 states have call successors, (34), 11 states have call predecessors, (34), 12 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-07-13 22:58:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 171 transitions. [2022-07-13 22:58:04,774 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 171 transitions. Word has length 130 [2022-07-13 22:58:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:04,774 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 171 transitions. [2022-07-13 22:58:04,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 5 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 22:58:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2022-07-13 22:58:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 22:58:04,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:04,775 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:04,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 22:58:04,775 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:04,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1012258245, now seen corresponding path program 1 times [2022-07-13 22:58:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:04,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289363320] [2022-07-13 22:58:04,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:58:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 22:58:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:05,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289363320] [2022-07-13 22:58:05,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289363320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:05,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251772339] [2022-07-13 22:58:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:05,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:05,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:05,197 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:05,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:58:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 2591 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 22:58:05,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:58:05,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:05,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251772339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:05,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:05,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [22] total 31 [2022-07-13 22:58:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904597813] [2022-07-13 22:58:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:05,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 22:58:05,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:05,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 22:58:05,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2022-07-13 22:58:05,765 INFO L87 Difference]: Start difference. First operand 137 states and 171 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 7 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-13 22:58:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:06,035 INFO L93 Difference]: Finished difference Result 156 states and 191 transitions. [2022-07-13 22:58:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:58:06,036 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 7 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) Word has length 95 [2022-07-13 22:58:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:06,036 INFO L225 Difference]: With dead ends: 156 [2022-07-13 22:58:06,037 INFO L226 Difference]: Without dead ends: 135 [2022-07-13 22:58:06,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 22:58:06,037 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 50 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:06,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1439 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-13 22:58:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-13 22:58:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.146067415730337) internal successors, (102), 91 states have internal predecessors, (102), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 22:58:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 168 transitions. [2022-07-13 22:58:06,043 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 168 transitions. Word has length 95 [2022-07-13 22:58:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:06,043 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 168 transitions. [2022-07-13 22:58:06,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 7 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-13 22:58:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 168 transitions. [2022-07-13 22:58:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 22:58:06,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:06,044 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:06,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:06,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 22:58:06,245 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash -980705660, now seen corresponding path program 1 times [2022-07-13 22:58:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:06,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571029547] [2022-07-13 22:58:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:06,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:58:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 22:58:06,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:06,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571029547] [2022-07-13 22:58:06,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571029547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:06,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028352454] [2022-07-13 22:58:06,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:06,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:06,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:06,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:06,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 22:58:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 2590 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 22:58:06,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:58:07,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:07,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028352454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:07,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:07,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2022-07-13 22:58:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716977701] [2022-07-13 22:58:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:07,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:58:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:58:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:58:07,071 INFO L87 Difference]: Start difference. First operand 135 states and 168 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-13 22:58:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:07,156 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2022-07-13 22:58:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:58:07,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 95 [2022-07-13 22:58:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:07,157 INFO L225 Difference]: With dead ends: 172 [2022-07-13 22:58:07,157 INFO L226 Difference]: Without dead ends: 146 [2022-07-13 22:58:07,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:58:07,158 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 10 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:07,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 562 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-13 22:58:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-07-13 22:58:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 97 states have internal predecessors, (108), 37 states have call successors, (37), 11 states have call predecessors, (37), 11 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 22:58:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 180 transitions. [2022-07-13 22:58:07,163 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 180 transitions. Word has length 95 [2022-07-13 22:58:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:07,163 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 180 transitions. [2022-07-13 22:58:07,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-13 22:58:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 180 transitions. [2022-07-13 22:58:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-13 22:58:07,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:07,164 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:07,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:07,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 22:58:07,374 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:07,375 INFO L85 PathProgramCache]: Analyzing trace with hash 823576615, now seen corresponding path program 1 times [2022-07-13 22:58:07,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:07,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936820637] [2022-07-13 22:58:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:07,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:58:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:58:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 22:58:07,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:07,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936820637] [2022-07-13 22:58:07,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936820637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:07,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662381164] [2022-07-13 22:58:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:07,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:07,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:07,726 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:07,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 22:58:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 2618 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 22:58:08,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:58:08,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:08,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662381164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:08,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:08,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18] total 24 [2022-07-13 22:58:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707061498] [2022-07-13 22:58:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:08,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:58:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:58:08,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:58:08,198 INFO L87 Difference]: Start difference. First operand 144 states and 180 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 22:58:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:08,318 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2022-07-13 22:58:08,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:58:08,318 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 104 [2022-07-13 22:58:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:08,319 INFO L225 Difference]: With dead ends: 165 [2022-07-13 22:58:08,319 INFO L226 Difference]: Without dead ends: 135 [2022-07-13 22:58:08,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:58:08,320 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 33 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:08,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1102 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-13 22:58:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-13 22:58:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 91 states have internal predecessors, (100), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 22:58:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 166 transitions. [2022-07-13 22:58:08,328 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 166 transitions. Word has length 104 [2022-07-13 22:58:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:08,328 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 166 transitions. [2022-07-13 22:58:08,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 22:58:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 166 transitions. [2022-07-13 22:58:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 22:58:08,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:08,329 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:08,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:08,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:08,543 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash -205130273, now seen corresponding path program 1 times [2022-07-13 22:58:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:08,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466360412] [2022-07-13 22:58:08,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:58:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:58:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:58:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 22:58:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:08,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466360412] [2022-07-13 22:58:08,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466360412] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:08,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774284559] [2022-07-13 22:58:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:08,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:08,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:08,836 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:08,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 22:58:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 2619 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-13 22:58:09,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:09,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:58:23,122 INFO L356 Elim1Store]: treesize reduction 168, result has 24.0 percent of original size [2022-07-13 22:58:23,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 223 treesize of output 183 [2022-07-13 22:58:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 22:58:23,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:23,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774284559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:23,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:23,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [13] total 41 [2022-07-13 22:58:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425919060] [2022-07-13 22:58:23,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:23,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 22:58:23,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:23,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 22:58:23,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1533, Unknown=6, NotChecked=0, Total=1640 [2022-07-13 22:58:23,469 INFO L87 Difference]: Start difference. First operand 135 states and 166 transitions. Second operand has 31 states, 28 states have (on average 2.25) internal successors, (63), 24 states have internal predecessors, (63), 8 states have call successors, (16), 4 states have call predecessors, (16), 8 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-13 22:58:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:36,763 INFO L93 Difference]: Finished difference Result 222 states and 284 transitions. [2022-07-13 22:58:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-13 22:58:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.25) internal successors, (63), 24 states have internal predecessors, (63), 8 states have call successors, (16), 4 states have call predecessors, (16), 8 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Word has length 105 [2022-07-13 22:58:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:36,765 INFO L225 Difference]: With dead ends: 222 [2022-07-13 22:58:36,765 INFO L226 Difference]: Without dead ends: 219 [2022-07-13 22:58:36,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=189, Invalid=2880, Unknown=11, NotChecked=0, Total=3080 [2022-07-13 22:58:36,766 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 111 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:36,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 2596 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 995 Invalid, 0 Unknown, 303 Unchecked, 0.6s Time] [2022-07-13 22:58:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-13 22:58:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 206. [2022-07-13 22:58:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 142 states have internal predecessors, (156), 48 states have call successors, (48), 14 states have call predecessors, (48), 18 states have return successors, (60), 49 states have call predecessors, (60), 46 states have call successors, (60) [2022-07-13 22:58:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 264 transitions. [2022-07-13 22:58:36,775 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 264 transitions. Word has length 105 [2022-07-13 22:58:36,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:36,776 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 264 transitions. [2022-07-13 22:58:36,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.25) internal successors, (63), 24 states have internal predecessors, (63), 8 states have call successors, (16), 4 states have call predecessors, (16), 8 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-13 22:58:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 264 transitions. [2022-07-13 22:58:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 22:58:36,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:36,777 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2022-07-13 22:58:36,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:36,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 22:58:36,996 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1014476899, now seen corresponding path program 1 times [2022-07-13 22:58:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:36,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355790292] [2022-07-13 22:58:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:58:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:58:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:58:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 22:58:37,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:37,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355790292] [2022-07-13 22:58:37,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355790292] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:37,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709736500] [2022-07-13 22:58:37,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:37,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:37,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:37,389 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:37,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 22:58:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 22:58:37,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 22:58:38,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:38,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709736500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:38,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:38,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 32 [2022-07-13 22:58:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177767341] [2022-07-13 22:58:38,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:38,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:58:38,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:38,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:58:38,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=921, Unknown=0, NotChecked=0, Total=992 [2022-07-13 22:58:38,007 INFO L87 Difference]: Start difference. First operand 206 states and 264 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:58:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:38,210 INFO L93 Difference]: Finished difference Result 243 states and 313 transitions. [2022-07-13 22:58:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:58:38,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) Word has length 105 [2022-07-13 22:58:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:38,212 INFO L225 Difference]: With dead ends: 243 [2022-07-13 22:58:38,212 INFO L226 Difference]: Without dead ends: 183 [2022-07-13 22:58:38,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=1303, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 22:58:38,213 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 37 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:38,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1188 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-13 22:58:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-07-13 22:58:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 123 states have (on average 1.113821138211382) internal successors, (137), 126 states have internal predecessors, (137), 43 states have call successors, (43), 13 states have call predecessors, (43), 16 states have return successors, (53), 43 states have call predecessors, (53), 41 states have call successors, (53) [2022-07-13 22:58:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 233 transitions. [2022-07-13 22:58:38,220 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 233 transitions. Word has length 105 [2022-07-13 22:58:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:38,220 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 233 transitions. [2022-07-13 22:58:38,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 22:58:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2022-07-13 22:58:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 22:58:38,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:38,221 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2022-07-13 22:58:38,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:38,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 22:58:38,435 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:38,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1234489571, now seen corresponding path program 2 times [2022-07-13 22:58:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:38,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772935772] [2022-07-13 22:58:38,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:38,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:58:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:58:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:58:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 22:58:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772935772] [2022-07-13 22:58:38,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772935772] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000696564] [2022-07-13 22:58:38,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:58:38,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:38,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:38,855 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:38,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 22:58:39,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:58:39,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:58:39,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 22:58:39,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:58:39,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:39,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000696564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:39,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:39,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [23] total 37 [2022-07-13 22:58:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665174709] [2022-07-13 22:58:39,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:39,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 22:58:39,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:39,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 22:58:39,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1243, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 22:58:39,566 INFO L87 Difference]: Start difference. First operand 183 states and 233 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 14 states have internal predecessors, (57), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-13 22:58:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:39,875 INFO L93 Difference]: Finished difference Result 272 states and 351 transitions. [2022-07-13 22:58:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:58:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 14 states have internal predecessors, (57), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 105 [2022-07-13 22:58:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:39,876 INFO L225 Difference]: With dead ends: 272 [2022-07-13 22:58:39,876 INFO L226 Difference]: Without dead ends: 186 [2022-07-13 22:58:39,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=1764, Unknown=0, NotChecked=0, Total=1892 [2022-07-13 22:58:39,878 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 61 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:39,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1536 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-13 22:58:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-13 22:58:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 43 states have call successors, (43), 13 states have call predecessors, (43), 17 states have return successors, (57), 43 states have call predecessors, (57), 41 states have call successors, (57) [2022-07-13 22:58:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 239 transitions. [2022-07-13 22:58:39,886 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 239 transitions. Word has length 105 [2022-07-13 22:58:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:39,886 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 239 transitions. [2022-07-13 22:58:39,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 14 states have internal predecessors, (57), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-13 22:58:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-07-13 22:58:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 22:58:39,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:39,887 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:39,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:40,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:40,107 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:40,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1688670427, now seen corresponding path program 1 times [2022-07-13 22:58:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:40,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730231152] [2022-07-13 22:58:40,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:40,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:58:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:58:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:58:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 22:58:40,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:40,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730231152] [2022-07-13 22:58:40,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730231152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:40,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773846613] [2022-07-13 22:58:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:40,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:40,488 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:40,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 22:58:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 22:58:40,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:58:40,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:40,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773846613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:40,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:40,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [21] total 26 [2022-07-13 22:58:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119386922] [2022-07-13 22:58:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:40,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:58:40,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:40,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:58:40,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:58:40,954 INFO L87 Difference]: Start difference. First operand 186 states and 239 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 12 states have internal predecessors, (57), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-13 22:58:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:41,152 INFO L93 Difference]: Finished difference Result 265 states and 330 transitions. [2022-07-13 22:58:41,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:58:41,152 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 12 states have internal predecessors, (57), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 105 [2022-07-13 22:58:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:41,153 INFO L225 Difference]: With dead ends: 265 [2022-07-13 22:58:41,153 INFO L226 Difference]: Without dead ends: 126 [2022-07-13 22:58:41,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:58:41,156 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 47 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:41,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1399 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-13 22:58:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2022-07-13 22:58:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 83 states have internal predecessors, (89), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-13 22:58:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2022-07-13 22:58:41,166 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 105 [2022-07-13 22:58:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:41,166 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2022-07-13 22:58:41,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 12 states have internal predecessors, (57), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-13 22:58:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2022-07-13 22:58:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 22:58:41,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:41,167 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:41,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:41,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:41,379 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1081095353, now seen corresponding path program 1 times [2022-07-13 22:58:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:41,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634552703] [2022-07-13 22:58:41,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:41,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:58:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:58:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:58:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:58:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 22:58:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:58:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-13 22:58:41,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:41,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634552703] [2022-07-13 22:58:41,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634552703] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:41,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794855864] [2022-07-13 22:58:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:41,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:41,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:41,655 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:41,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 22:58:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:42,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 2677 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-13 22:58:42,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:42,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:58:42,381 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 22:58:42,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 41 [2022-07-13 22:58:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-13 22:58:42,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:43,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794855864] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:43,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:58:43,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 30 [2022-07-13 22:58:43,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522378013] [2022-07-13 22:58:43,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:43,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 22:58:43,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:43,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 22:58:43,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 22:58:43,042 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 30 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 23 states have internal predecessors, (89), 11 states have call successors, (33), 5 states have call predecessors, (33), 7 states have return successors, (31), 12 states have call predecessors, (31), 10 states have call successors, (31) [2022-07-13 22:58:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:43,582 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2022-07-13 22:58:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:58:43,583 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 23 states have internal predecessors, (89), 11 states have call successors, (33), 5 states have call predecessors, (33), 7 states have return successors, (31), 12 states have call predecessors, (31), 10 states have call successors, (31) Word has length 121 [2022-07-13 22:58:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:43,583 INFO L225 Difference]: With dead ends: 130 [2022-07-13 22:58:43,583 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 22:58:43,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=1819, Unknown=0, NotChecked=0, Total=1980 [2022-07-13 22:58:43,584 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:43,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 335 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:58:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 22:58:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 22:58:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:58:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 22:58:43,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2022-07-13 22:58:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:43,586 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 22:58:43,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 23 states have internal predecessors, (89), 11 states have call successors, (33), 5 states have call predecessors, (33), 7 states have return successors, (31), 12 states have call predecessors, (31), 10 states have call successors, (31) [2022-07-13 22:58:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 22:58:43,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 22:58:43,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 22:58:43,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:43,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-13 22:58:43,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 22:58:45,070 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (let ((.cse8 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (or (exists ((v_prenex_1 Int) (|aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104| Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse1 (select |#memory_int| |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base|)) (.cse2 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 8))) (let ((.cse6 (store (store (store (store .cse1 .cse2 v_DerPreprocessor_3) v_DerPreprocessor_1 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) v_DerPreprocessor_2 v_DerPreprocessor_5))) (let ((.cse3 (select .cse6 .cse2))) (let ((.cse4 (mod .cse3 18446744073709551616))) (let ((.cse7 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 16 .cse4)) (.cse5 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| (- 18446744073709551600) .cse4)) (.cse0 (* 18446744073709551616 v_prenex_1))) (and (or (= (+ .cse0 (select .cse1 .cse2)) (+ (* 18446744073709551616 |aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104|) .cse3)) (= 18446744073709551608 .cse4)) (= (select .cse1 .cse5) 0) (= (select .cse6 .cse7) 0) (< 9223372036854775807 .cse4) (= .cse7 v_DerPreprocessor_2) (= (+ 18446744073709551600 v_DerPreprocessor_1) (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| .cse4)) (< .cse3 (+ (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616) .cse0)) (= v_DerPreprocessor_4 (select .cse6 .cse5)) (<= .cse0 .cse3)))))))) (let ((.cse11 (select |#memory_int| |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base|))) (let ((.cse9 (select .cse11 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 8)))) (let ((.cse10 (mod .cse9 18446744073709551616))) (and (< (div (+ (- 1) .cse8 (* (- 1) .cse9)) (- 18446744073709551616)) (+ (div .cse9 18446744073709551616) 1)) (<= .cse10 9223372036854775807) (= (select .cse11 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 16 .cse10)) 0)))))) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse8) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse8))) [2022-07-13 22:58:45,070 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-13 22:58:45,070 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (let ((.cse0 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse0))) [2022-07-13 22:58:45,070 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-13 22:58:45,070 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse0))) [2022-07-13 22:58:45,070 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-13 22:58:45,070 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (let ((.cse0 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse0))) [2022-07-13 22:58:45,070 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-13 22:58:45,071 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-13 22:58:45,071 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-13 22:58:45,071 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-13 22:58:45,071 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-13 22:58:45,071 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-13 22:58:45,071 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-13 22:58:45,071 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-13 22:58:45,071 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-13 22:58:45,071 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-13 22:58:45,071 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-13 22:58:45,071 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-13 22:58:45,071 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-13 22:58:45,071 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-13 22:58:45,071 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-13 22:58:45,071 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-13 22:58:45,071 INFO L902 garLoopResultBuilder]: At program point aws_string_bytesENTRY(lines 6242 6246) the Hoare annotation is: true [2022-07-13 22:58:45,072 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesEXIT(lines 6242 6246) no Hoare annotation was computed. [2022-07-13 22:58:45,072 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesFINAL(lines 6242 6246) no Hoare annotation was computed. [2022-07-13 22:58:45,072 INFO L902 garLoopResultBuilder]: At program point L6244-1(line 6244) the Hoare annotation is: true [2022-07-13 22:58:45,072 INFO L899 garLoopResultBuilder]: For program point L6244-2(line 6244) no Hoare annotation was computed. [2022-07-13 22:58:45,072 INFO L902 garLoopResultBuilder]: At program point L6244(line 6244) the Hoare annotation is: true [2022-07-13 22:58:45,072 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:58:45,072 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-13 22:58:45,072 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-13 22:58:45,072 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:58:45,072 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-13 22:58:45,072 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-13 22:58:45,072 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-13 22:58:45,072 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-13 22:58:45,072 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:45,072 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-13 22:58:45,073 INFO L895 garLoopResultBuilder]: At program point L9557(line 9557) the Hoare annotation is: false [2022-07-13 22:58:45,073 INFO L895 garLoopResultBuilder]: At program point L9557-1(line 9557) the Hoare annotation is: false [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point L9557-2(line 9557) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point L9549(lines 9549 9551) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point L9553-1(lines 9537 9559) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9559) no Hoare annotation was computed. [2022-07-13 22:58:45,073 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 22:58:45,074 INFO L895 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.base| 0) (not (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0)) (let ((.cse1 (select |#memory_int| |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base|))) (let ((.cse2 (mod (select .cse1 (+ 8 |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset|)) 18446744073709551616))) (let ((.cse0 (<= .cse2 9223372036854775807))) (or (and (not .cse0) (= (mod (select .cse1 (+ (- 18446744073709551600) |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| .cse2)) 256) 0)) (and .cse0 (= (mod (select .cse1 (+ 16 |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| .cse2)) 256) 0)))))) (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.offset| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2022-07-13 22:58:45,074 INFO L895 garLoopResultBuilder]: At program point L9554-1(line 9554) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.base| 0) (not (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0)) (= |ULTIMATE.start_aws_string_compare_harness_#t~ret1358#1| 1) (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.offset| 0)) [2022-07-13 22:58:45,074 INFO L899 garLoopResultBuilder]: For program point L9554-2(line 9554) no Hoare annotation was computed. [2022-07-13 22:58:45,074 INFO L899 garLoopResultBuilder]: For program point L9542-1(lines 9542 9544) no Hoare annotation was computed. [2022-07-13 22:58:45,074 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-13 22:58:45,074 INFO L895 garLoopResultBuilder]: At program point L9542-2(line 9542) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2022-07-13 22:58:45,074 INFO L899 garLoopResultBuilder]: For program point L9542-3(lines 9542 9543) no Hoare annotation was computed. [2022-07-13 22:58:45,074 INFO L902 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: true [2022-07-13 22:58:45,074 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-13 22:58:45,074 INFO L895 garLoopResultBuilder]: At program point L9542(line 9542) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2022-07-13 22:58:45,074 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-13 22:58:45,074 INFO L899 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2022-07-13 22:58:45,074 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 22:58:45,074 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-13 22:58:45,074 INFO L899 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2022-07-13 22:58:45,074 INFO L899 garLoopResultBuilder]: For program point L9542-5(lines 9542 9543) no Hoare annotation was computed. [2022-07-13 22:58:45,074 INFO L902 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: true [2022-07-13 22:58:45,075 INFO L899 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2022-07-13 22:58:45,075 INFO L899 garLoopResultBuilder]: For program point L9542-7(lines 9542 9544) no Hoare annotation was computed. [2022-07-13 22:58:45,076 INFO L895 garLoopResultBuilder]: At program point L9547(line 9547) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.offset| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2022-07-13 22:58:45,076 INFO L899 garLoopResultBuilder]: For program point L9547-1(line 9547) no Hoare annotation was computed. [2022-07-13 22:58:45,076 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-13 22:58:45,076 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-13 22:58:45,076 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-13 22:58:45,076 INFO L902 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: true [2022-07-13 22:58:45,076 INFO L899 garLoopResultBuilder]: For program point L9548(line 9548) no Hoare annotation was computed. [2022-07-13 22:58:45,077 INFO L895 garLoopResultBuilder]: At program point L9548-2(line 9548) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0))) (or (and (= |ULTIMATE.start_aws_string_compare_harness_#t~ite1355#1.base| |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base|) .cse0 (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| |ULTIMATE.start_aws_string_compare_harness_#t~ite1355#1.offset|) .cse1 .cse2) (and (= |ULTIMATE.start_aws_string_compare_harness_#t~ite1355#1.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_aws_string_compare_harness_#t~ite1355#1.base| 0) .cse2))) [2022-07-13 22:58:45,077 INFO L899 garLoopResultBuilder]: For program point L9548-3(line 9548) no Hoare annotation was computed. [2022-07-13 22:58:45,077 INFO L902 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: true [2022-07-13 22:58:45,077 INFO L899 garLoopResultBuilder]: For program point L9548-4(lines 9548 9552) no Hoare annotation was computed. [2022-07-13 22:58:45,077 INFO L899 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2022-07-13 22:58:45,077 INFO L899 garLoopResultBuilder]: For program point L9548-5(lines 9537 9559) no Hoare annotation was computed. [2022-07-13 22:58:45,077 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-13 22:58:45,077 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-13 22:58:45,077 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-13 22:58:45,077 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:58:45,077 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:58:45,078 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-13 22:58:45,078 INFO L902 garLoopResultBuilder]: At program point aws_string_compareENTRY(lines 9218 9252) the Hoare annotation is: true [2022-07-13 22:58:45,078 INFO L899 garLoopResultBuilder]: For program point L9239-2(line 9239) no Hoare annotation was computed. [2022-07-13 22:58:45,078 INFO L895 garLoopResultBuilder]: At program point L9239(line 9239) the Hoare annotation is: (and (or (not (= |aws_string_compare_#in~b.base| 0)) (not (= |aws_string_compare_#in~b.offset| 0))) (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)))) [2022-07-13 22:58:45,079 INFO L895 garLoopResultBuilder]: At program point L9239-1(line 9239) the Hoare annotation is: (and (or (not (= |aws_string_compare_#in~b.base| 0)) (not (= |aws_string_compare_#in~b.offset| 0))) (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)))) [2022-07-13 22:58:45,079 INFO L899 garLoopResultBuilder]: For program point L9219(line 9219) no Hoare annotation was computed. [2022-07-13 22:58:45,079 INFO L895 garLoopResultBuilder]: At program point L9219-2(line 9219) the Hoare annotation is: (let ((.cse6 (= aws_string_compare_~a.base 0)) (.cse5 (not |aws_string_compare_#t~short1262|))) (let ((.cse0 (or .cse6 .cse5)) (.cse1 (= aws_string_compare_~a.base |aws_string_compare_#in~a.base|)) (.cse2 (= |aws_string_compare_#in~b.offset| aws_string_compare_~b.offset)) (.cse3 (let ((.cse4 (= aws_string_compare_~a.offset 0))) (or (and |aws_string_compare_#t~short1262| .cse4) (and .cse5 (or (not .cse4) (not .cse6))))))) (and (or (and (= aws_string_compare_~a.offset |aws_string_compare_#in~a.offset|) .cse0 .cse1 (= aws_string_compare_~b.base 0) .cse2 .cse3) (not (= |aws_string_compare_#in~b.base| 0)) (not (= |aws_string_compare_#in~b.offset| 0))) (or (and (= aws_string_compare_~a.offset aws_string_compare_~b.offset) (= aws_string_compare_~a.base aws_string_compare_~b.base) .cse0 .cse1 .cse2 .cse3) (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)))))) [2022-07-13 22:58:45,079 INFO L899 garLoopResultBuilder]: For program point L9219-3(line 9219) no Hoare annotation was computed. [2022-07-13 22:58:45,079 INFO L899 garLoopResultBuilder]: For program point L9248(lines 9248 9250) no Hoare annotation was computed. [2022-07-13 22:58:45,079 INFO L895 garLoopResultBuilder]: At program point L9219-4(line 9219) the Hoare annotation is: (let ((.cse0 (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|))) (.cse1 (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) (.cse4 (let ((.cse14 (select |#memory_int| |aws_string_compare_#in~a.base|))) (let ((.cse15 (mod (select .cse14 (+ |aws_string_compare_#in~a.offset| 8)) 18446744073709551616))) (let ((.cse11 (<= .cse15 9223372036854775807))) (let ((.cse12 (not .cse11)) (.cse13 (= (mod (select .cse14 (+ (- 18446744073709551600) |aws_string_compare_#in~a.offset| .cse15)) 256) 0)) (.cse10 (= (mod (select .cse14 (+ 16 |aws_string_compare_#in~a.offset| .cse15)) 256) 0))) (let ((.cse9 (or (and .cse12 .cse13) (and .cse10 .cse11))) (.cse8 (or (and (not .cse10) .cse11) (and .cse12 (not .cse13))))) (and (or (and .cse8 (= |aws_string_compare_#t~ret1261| 0)) (and .cse9 (= |aws_string_compare_#t~ret1261| 1))) (or (and .cse9 |aws_string_compare_#t~short1262|) (and .cse8 (not |aws_string_compare_#t~short1262|)))))))))) (.cse5 (<= (+ 16 |aws_string_compare_#in~a.offset|) 0)) (.cse2 (= aws_string_compare_~a.base |aws_string_compare_#in~a.base|)) (.cse3 (= |aws_string_compare_#in~b.offset| aws_string_compare_~b.offset)) (.cse6 (not (= |aws_string_compare_#in~b.base| 0))) (.cse7 (not (= |aws_string_compare_#in~b.offset| 0)))) (and (or .cse0 .cse1 (and (= aws_string_compare_~a.offset aws_string_compare_~b.offset) (= aws_string_compare_~a.base aws_string_compare_~b.base) .cse2 .cse3)) (or (= aws_string_compare_~a.base 0) .cse0 .cse1 .cse4 .cse5) (or (= |aws_string_compare_#in~a.base| 0) .cse6 .cse4 .cse7 .cse5) (or (and (= aws_string_compare_~a.offset |aws_string_compare_#in~a.offset|) .cse2 (= aws_string_compare_~b.base 0) .cse3) .cse6 .cse7))) [2022-07-13 22:58:45,079 INFO L899 garLoopResultBuilder]: For program point L9219-5(line 9219) no Hoare annotation was computed. [2022-07-13 22:58:45,079 INFO L895 garLoopResultBuilder]: At program point L9240(line 9240) the Hoare annotation is: (and (or (not (= |aws_string_compare_#in~b.base| 0)) (not (= |aws_string_compare_#in~b.offset| 0))) (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)))) [2022-07-13 22:58:45,080 INFO L895 garLoopResultBuilder]: At program point L9240-1(line 9240) the Hoare annotation is: (and (or (not (= |aws_string_compare_#in~b.base| 0)) (not (= |aws_string_compare_#in~b.offset| 0))) (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)))) [2022-07-13 22:58:45,080 INFO L899 garLoopResultBuilder]: For program point L9240-2(line 9240) no Hoare annotation was computed. [2022-07-13 22:58:45,080 INFO L899 garLoopResultBuilder]: For program point L9220(line 9220) no Hoare annotation was computed. [2022-07-13 22:58:45,080 INFO L895 garLoopResultBuilder]: At program point L9220-2(line 9220) the Hoare annotation is: (let ((.cse7 (= |aws_string_compare_#in~a.base| 0)) (.cse0 (let ((.cse13 (select |#memory_int| |aws_string_compare_#in~a.base|))) (let ((.cse14 (mod (select .cse13 (+ |aws_string_compare_#in~a.offset| 8)) 18446744073709551616))) (let ((.cse12 (<= .cse14 9223372036854775807))) (or (and (not .cse12) (= (mod (select .cse13 (+ (- 18446744073709551600) |aws_string_compare_#in~a.offset| .cse14)) 256) 0)) (and (= (mod (select .cse13 (+ 16 |aws_string_compare_#in~a.offset| .cse14)) 256) 0) .cse12)))))) (.cse4 (= aws_string_compare_~a.base |aws_string_compare_#in~a.base|)) (.cse8 (= |aws_string_compare_#in~b.base| 0)) (.cse6 (<= (+ 16 |aws_string_compare_#in~a.offset|) 0)) (.cse5 (= |aws_string_compare_#in~b.offset| aws_string_compare_~b.offset))) (and (let ((.cse1 (or (not |aws_string_compare_#t~short1264|) .cse8)) (.cse2 (= aws_string_compare_~a.offset aws_string_compare_~b.offset)) (.cse3 (= aws_string_compare_~a.base aws_string_compare_~b.base))) (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse7 .cse2 .cse3 .cse4 .cse5))) (let ((.cse9 (= aws_string_compare_~b.offset 0)) (.cse10 (= aws_string_compare_~a.offset |aws_string_compare_#in~a.offset|)) (.cse11 (= aws_string_compare_~b.base 0))) (or (and .cse7 .cse9 .cse10 .cse4 .cse11 .cse8 .cse5) (not .cse8) (and .cse0 .cse9 .cse10 .cse4 .cse11 .cse8 .cse5) (and .cse9 .cse10 .cse4 .cse11 .cse8 .cse6 .cse5) (not (= |aws_string_compare_#in~b.offset| 0)))))) [2022-07-13 22:58:45,080 INFO L899 garLoopResultBuilder]: For program point L9224(lines 9224 9228) no Hoare annotation was computed. [2022-07-13 22:58:45,080 INFO L899 garLoopResultBuilder]: For program point L9245(lines 9245 9247) no Hoare annotation was computed. [2022-07-13 22:58:45,080 INFO L899 garLoopResultBuilder]: For program point L9220-3(line 9220) no Hoare annotation was computed. [2022-07-13 22:58:45,081 INFO L895 garLoopResultBuilder]: At program point L9220-4(line 9220) the Hoare annotation is: (let ((.cse11 (= aws_string_compare_~b.base |aws_string_compare_#in~b.base|)) (.cse12 (= aws_string_compare_~a.offset |aws_string_compare_#in~a.offset|)) (.cse4 (= aws_string_compare_~a.base |aws_string_compare_#in~a.base|)) (.cse9 (= |aws_string_compare_#in~b.base| 0)) (.cse5 (= |aws_string_compare_#in~b.offset| aws_string_compare_~b.offset))) (let ((.cse1 (let ((.cse14 (select |#memory_int| |aws_string_compare_#in~a.base|))) (let ((.cse15 (mod (select .cse14 (+ |aws_string_compare_#in~a.offset| 8)) 18446744073709551616))) (let ((.cse13 (<= .cse15 9223372036854775807))) (or (and (not .cse13) (= (mod (select .cse14 (+ (- 18446744073709551600) |aws_string_compare_#in~a.offset| .cse15)) 256) 0)) (and (= (mod (select .cse14 (+ 16 |aws_string_compare_#in~a.offset| .cse15)) 256) 0) .cse13)))))) (.cse7 (<= (+ 16 |aws_string_compare_#in~a.offset|) 0)) (.cse0 (and .cse11 .cse12 .cse4 .cse9 .cse5)) (.cse6 (and (= aws_string_compare_~a.base 0) .cse11 .cse12 .cse4 .cse5))) (and (let ((.cse2 (= aws_string_compare_~a.offset aws_string_compare_~b.offset)) (.cse3 (= aws_string_compare_~a.base aws_string_compare_~b.base))) (or .cse0 (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)) .cse6 (and .cse2 .cse3 .cse4 .cse7 .cse5))) (let ((.cse8 (= aws_string_compare_~b.offset 0)) (.cse10 (or .cse0 .cse6))) (or (and .cse1 .cse8 .cse9 .cse10) (and .cse8 .cse9 .cse10 .cse7) (and (= |aws_string_compare_#in~a.base| 0) .cse8 .cse9 .cse10) (not .cse9) (not (= |aws_string_compare_#in~b.offset| 0))))))) [2022-07-13 22:58:45,081 INFO L899 garLoopResultBuilder]: For program point L9220-5(line 9220) no Hoare annotation was computed. [2022-07-13 22:58:45,081 INFO L899 garLoopResultBuilder]: For program point L9237(line 9237) no Hoare annotation was computed. [2022-07-13 22:58:45,081 INFO L899 garLoopResultBuilder]: For program point L9237-2(line 9237) no Hoare annotation was computed. [2022-07-13 22:58:45,082 INFO L895 garLoopResultBuilder]: At program point L9241(line 9241) the Hoare annotation is: (and (or (not (= |aws_string_compare_#in~b.base| 0)) (not (= |aws_string_compare_#in~b.offset| 0))) (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)))) [2022-07-13 22:58:45,082 INFO L895 garLoopResultBuilder]: At program point L9241-1(line 9241) the Hoare annotation is: (and (or (not (= |aws_string_compare_#in~b.base| 0)) (not (= |aws_string_compare_#in~b.offset| 0))) (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)))) [2022-07-13 22:58:45,082 INFO L899 garLoopResultBuilder]: For program point L9241-2(line 9241) no Hoare annotation was computed. [2022-07-13 22:58:45,082 INFO L899 garLoopResultBuilder]: For program point L9229(lines 9229 9233) no Hoare annotation was computed. [2022-07-13 22:58:45,082 INFO L899 garLoopResultBuilder]: For program point L9221(lines 9221 9223) no Hoare annotation was computed. [2022-07-13 22:58:45,082 INFO L899 garLoopResultBuilder]: For program point L9242(lines 9242 9244) no Hoare annotation was computed. [2022-07-13 22:58:45,082 INFO L899 garLoopResultBuilder]: For program point aws_string_compareEXIT(lines 9218 9252) no Hoare annotation was computed. [2022-07-13 22:58:45,082 INFO L899 garLoopResultBuilder]: For program point aws_string_compareFINAL(lines 9218 9252) no Hoare annotation was computed. [2022-07-13 22:58:45,085 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:45,089 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 22:58:45,100 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104,QUANTIFIED] [2022-07-13 22:58:45,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,106 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,106 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,106 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,106 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,106 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,106 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,112 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,112 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,112 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,114 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,114 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,116 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,116 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,116 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,116 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,116 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,133 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104,QUANTIFIED] [2022-07-13 22:58:45,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,137 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,138 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,138 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,138 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,138 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,138 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,145 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 10:58:45 BoogieIcfgContainer [2022-07-13 22:58:45,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 22:58:45,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 22:58:45,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 22:58:45,154 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 22:58:45,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:57:47" (3/4) ... [2022-07-13 22:58:45,157 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 22:58:45,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:58:45,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-13 22:58:45,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-13 22:58:45,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-13 22:58:45,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_bytes [2022-07-13 22:58:45,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-13 22:58:45,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-13 22:58:45,161 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_compare [2022-07-13 22:58:45,162 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-13 22:58:45,162 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-13 22:58:45,174 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 125 nodes and edges [2022-07-13 22:58:45,175 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2022-07-13 22:58:45,176 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-07-13 22:58:45,176 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-13 22:58:45,177 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-13 22:58:45,178 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 22:58:45,179 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 22:58:45,180 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 22:58:45,205 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(max_size) == max_size && ((\exists v_prenex_1 : int, aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104 : int, v_DerPreprocessor_5 : int, v_DerPreprocessor_4 : int, v_DerPreprocessor_3 : int, v_DerPreprocessor_2 : int, v_DerPreprocessor_1 : int :: ((((((((18446744073709551616 * v_prenex_1 + unknown-#memory_int-unknown[\result][\result + 8] == 18446744073709551616 * aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104 + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] || 18446744073709551608 == unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616) && unknown-#memory_int-unknown[\result][\result + -18446744073709551600 + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616] == 0) && unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 16 + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616] == 0) && 9223372036854775807 < unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616) && \result + 16 + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616 == v_DerPreprocessor_2) && 18446744073709551600 + v_DerPreprocessor_1 == \result + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616) && unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] < \old(max_size) % 18446744073709551616 + 18446744073709551616 * v_prenex_1) && v_DerPreprocessor_4 == unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + -18446744073709551600 + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616]) && 18446744073709551616 * v_prenex_1 <= unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8]) || (((-1 + \old(max_size) % 18446744073709551616 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < unknown-#memory_int-unknown[\result][\result + 8] / 18446744073709551616 + 1 && unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616 <= 9223372036854775807) && unknown-#memory_int-unknown[\result][\result + 16 + unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616] == 0))) && !(str == 0)) && str == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616 [2022-07-13 22:58:45,473 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 22:58:45,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 22:58:45,474 INFO L158 Benchmark]: Toolchain (without parser) took 60874.08ms. Allocated memory was 96.5MB in the beginning and 465.6MB in the end (delta: 369.1MB). Free memory was 56.3MB in the beginning and 173.8MB in the end (delta: -117.5MB). Peak memory consumption was 249.7MB. Max. memory is 16.1GB. [2022-07-13 22:58:45,474 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 54.4MB in the beginning and 54.3MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:58:45,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1746.95ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 56.1MB in the beginning and 110.9MB in the end (delta: -54.8MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2022-07-13 22:58:45,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 161.96ms. Allocated memory is still 172.0MB. Free memory was 110.9MB in the beginning and 99.5MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 22:58:45,475 INFO L158 Benchmark]: Boogie Preprocessor took 76.99ms. Allocated memory is still 172.0MB. Free memory was 99.5MB in the beginning and 93.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 22:58:45,475 INFO L158 Benchmark]: RCFGBuilder took 1036.80ms. Allocated memory is still 172.0MB. Free memory was 93.2MB in the beginning and 62.1MB in the end (delta: 31.2MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2022-07-13 22:58:45,475 INFO L158 Benchmark]: TraceAbstraction took 57524.41ms. Allocated memory was 172.0MB in the beginning and 465.6MB in the end (delta: 293.6MB). Free memory was 62.1MB in the beginning and 304.9MB in the end (delta: -242.8MB). Peak memory consumption was 230.1MB. Max. memory is 16.1GB. [2022-07-13 22:58:45,475 INFO L158 Benchmark]: Witness Printer took 319.40ms. Allocated memory is still 465.6MB. Free memory was 304.9MB in the beginning and 173.8MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-13 22:58:45,487 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 54.4MB in the beginning and 54.3MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1746.95ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 56.1MB in the beginning and 110.9MB in the end (delta: -54.8MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 161.96ms. Allocated memory is still 172.0MB. Free memory was 110.9MB in the beginning and 99.5MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.99ms. Allocated memory is still 172.0MB. Free memory was 99.5MB in the beginning and 93.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1036.80ms. Allocated memory is still 172.0MB. Free memory was 93.2MB in the beginning and 62.1MB in the end (delta: 31.2MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * TraceAbstraction took 57524.41ms. Allocated memory was 172.0MB in the beginning and 465.6MB in the end (delta: 293.6MB). Free memory was 62.1MB in the beginning and 304.9MB in the end (delta: -242.8MB). Peak memory consumption was 230.1MB. Max. memory is 16.1GB. * Witness Printer took 319.40ms. Allocated memory is still 465.6MB. Free memory was 304.9MB in the beginning and 173.8MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.4s, OverallIterations: 21, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1607 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1402 mSDsluCounter, 23095 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 646 IncrementalHoareTripleChecker+Unchecked, 20250 mSDsCounter, 631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9935 IncrementalHoareTripleChecker+Invalid, 11212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 631 mSolverCounterUnsat, 2845 mSDtfsCounter, 9935 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2177 GetRequests, 1653 SyntacticMatches, 10 SemanticMatches, 514 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2771 ImplicationChecksByTransitivity, 33.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=17, InterpolantAutomatonStates: 258, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 166 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 394 PreInvPairs, 490 NumberOfFragments, 2260 HoareAnnotationTreeSize, 394 FomulaSimplifications, 833 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 3477 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 26.9s InterpolantComputationTime, 3151 NumberOfCodeBlocks, 3151 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3207 ConstructedInterpolants, 42 QuantifiedInterpolants, 15709 SizeOfPredicates, 149 NumberOfNonLiveVariables, 31360 ConjunctsInSsa, 460 ConjunctsInUnsatCore, 34 InterpolantComputations, 19 PerfectInterpolantSequences, 1725/1906 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6806]: Loop Invariant [2022-07-13 22:58:45,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104,QUANTIFIED] [2022-07-13 22:58:45,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,510 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,513 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104,QUANTIFIED] [2022-07-13 22:58:45,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,522 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,522 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,522 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,523 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2022-07-13 22:58:45,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2022-07-13 22:58:45,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-07-13 22:58:45,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2022-07-13 22:58:45,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-07-13 22:58:45,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-07-13 22:58:45,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] Derived loop invariant: (((((((\old(max_size) == max_size && ((\exists v_prenex_1 : int, aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104 : int, v_DerPreprocessor_5 : int, v_DerPreprocessor_4 : int, v_DerPreprocessor_3 : int, v_DerPreprocessor_2 : int, v_DerPreprocessor_1 : int :: ((((((((18446744073709551616 * v_prenex_1 + unknown-#memory_int-unknown[\result][\result + 8] == 18446744073709551616 * aux_div_ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1_104 + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] || 18446744073709551608 == unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616) && unknown-#memory_int-unknown[\result][\result + -18446744073709551600 + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616] == 0) && unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 16 + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616] == 0) && 9223372036854775807 < unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616) && \result + 16 + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616 == v_DerPreprocessor_2) && 18446744073709551600 + v_DerPreprocessor_1 == \result + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616) && unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] < \old(max_size) % 18446744073709551616 + 18446744073709551616 * v_prenex_1) && v_DerPreprocessor_4 == unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + -18446744073709551600 + unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8] % 18446744073709551616]) && 18446744073709551616 * v_prenex_1 <= unknown-#memory_int-unknown[\result][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_1 := v_DerPreprocessor_4][\result + 8 := v_DerPreprocessor_3][v_DerPreprocessor_2 := v_DerPreprocessor_5][\result + 8]) || (((-1 + \old(max_size) % 18446744073709551616 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < unknown-#memory_int-unknown[\result][\result + 8] / 18446744073709551616 + 1 && unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616 <= 9223372036854775807) && unknown-#memory_int-unknown[\result][\result + 16 + unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616] == 0))) && !(str == 0)) && str == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616 - InvariantResult [Line: 9560]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-13 22:58:45,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE