./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_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_eq_byte_cursor_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 caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:58:06,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:58:06,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:58:06,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:58:06,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:58:06,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:58:06,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:58:06,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:58:06,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:58:06,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:58:06,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:58:06,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:58:06,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:58:06,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:58:06,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:58:06,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:58:06,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:58:06,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:58:06,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:58:06,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:58:06,171 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:58:06,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:58:06,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:58:06,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:58:06,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:58:06,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:58:06,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:58:06,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:58:06,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:58:06,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:58:06,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:58:06,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:58:06,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:58:06,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:58:06,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:58:06,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:58:06,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:58:06,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:58:06,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:58:06,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:58:06,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:58:06,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:58:06,192 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:58:06,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:58:06,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:58:06,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:58:06,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:58:06,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:58:06,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:58:06,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:58:06,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:58:06,224 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:58:06,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:58:06,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:58:06,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:58:06,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:58:06,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:58:06,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:58:06,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:58:06,226 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:58:06,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:58:06,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:58:06,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:58:06,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:58:06,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:58:06,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:58:06,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:58:06,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:58:06,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:58:06,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:58:06,228 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:58:06,228 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:58:06,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:58:06,229 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 -> caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a [2022-07-13 22:58:06,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:58:06,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:58:06,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:58:06,514 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:58:06,514 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:58:06,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2022-07-13 22:58:06,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6821ce164/c268a942597541d59a5089664a0cbc2f/FLAG152b2af51 [2022-07-13 22:58:07,343 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:58:07,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2022-07-13 22:58:07,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6821ce164/c268a942597541d59a5089664a0cbc2f/FLAG152b2af51 [2022-07-13 22:58:07,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6821ce164/c268a942597541d59a5089664a0cbc2f [2022-07-13 22:58:07,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:58:07,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:58:07,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:58:07,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:58:07,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:58:07,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:58:07" (1/1) ... [2022-07-13 22:58:07,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@323440ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:07, skipping insertion in model container [2022-07-13 22:58:07,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:58:07" (1/1) ... [2022-07-13 22:58:07,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:58:07,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:58:07,799 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_eq_byte_cursor_harness.i[4499,4512] [2022-07-13 22:58:07,807 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_eq_byte_cursor_harness.i[4559,4572] [2022-07-13 22:58:08,584 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:08,585 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:08,590 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:08,591 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:08,594 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:08,624 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:08,627 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:08,629 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:08,631 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:08,990 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:58:08,991 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:58:08,993 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:58:08,994 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:58:08,998 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:58:09,002 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:58:09,003 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:58:09,004 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:58:09,007 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:58:09,009 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:58:09,135 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:58:09,283 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,291 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:58:09,461 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:58:09,485 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_eq_byte_cursor_harness.i[4499,4512] [2022-07-13 22:58:09,489 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_eq_byte_cursor_harness.i[4559,4572] [2022-07-13 22:58:09,531 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,532 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,533 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,534 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,534 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,544 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,546 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,547 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,548 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,584 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:58:09,584 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:58:09,585 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:58:09,586 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:58:09,586 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:58:09,587 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:58:09,587 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:58:09,587 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:58:09,588 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:58:09,588 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:58:09,606 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:58:09,717 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,718 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:09,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:58:09,979 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:58:09,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:09 WrapperNode [2022-07-13 22:58:09,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:58:09,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:58:09,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:58:09,981 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:58:09,988 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:58:09" (1/1) ... [2022-07-13 22:58:10,095 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:58:09" (1/1) ... [2022-07-13 22:58:10,172 INFO L137 Inliner]: procedures = 693, calls = 2789, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 869 [2022-07-13 22:58:10,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:58:10,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:58:10,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:58:10,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:58:10,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:09" (1/1) ... [2022-07-13 22:58:10,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:09" (1/1) ... [2022-07-13 22:58:10,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:09" (1/1) ... [2022-07-13 22:58:10,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:09" (1/1) ... [2022-07-13 22:58:10,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:09" (1/1) ... [2022-07-13 22:58:10,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:09" (1/1) ... [2022-07-13 22:58:10,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:09" (1/1) ... [2022-07-13 22:58:10,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:58:10,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:58:10,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:58:10,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:58:10,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:09" (1/1) ... [2022-07-13 22:58:10,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:58:10,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:10,307 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:58:10,332 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:58:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-13 22:58:10,351 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-13 22:58:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-13 22:58:10,352 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-13 22:58:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:58:10,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:58:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 22:58:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:58:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:58:10,353 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:58:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:58:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:58:10,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:58:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:58:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:58:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:58:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:58:10,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:58:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:58:10,355 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:58:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 22:58:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:58:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:58:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:58:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:58:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-07-13 22:58:10,357 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-07-13 22:58:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:58:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:58:10,358 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:58:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:58:10,358 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:58:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:58:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:58:10,631 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:58:10,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:58:11,666 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:58:11,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:58:11,673 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:58:11,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:58:11 BoogieIcfgContainer [2022-07-13 22:58:11,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:58:11,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:58:11,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:58:11,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:58:11,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:58:07" (1/3) ... [2022-07-13 22:58:11,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e3835c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:58:11, skipping insertion in model container [2022-07-13 22:58:11,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:09" (2/3) ... [2022-07-13 22:58:11,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e3835c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:58:11, skipping insertion in model container [2022-07-13 22:58:11,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:58:11" (3/3) ... [2022-07-13 22:58:11,682 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2022-07-13 22:58:11,696 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:58:11,696 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:58:11,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:58:11,745 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@3ca087e4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fa9af1f [2022-07-13 22:58:11,746 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:58:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-13 22:58:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 22:58:11,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:11,761 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:11,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash -386411024, now seen corresponding path program 1 times [2022-07-13 22:58:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:11,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327016166] [2022-07-13 22:58:11,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:58:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:58:12,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:12,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327016166] [2022-07-13 22:58:12,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327016166] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:12,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179461429] [2022-07-13 22:58:12,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:12,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:12,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:12,547 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:58:12,582 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:58:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:13,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 22:58:13,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:58:13,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:13,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179461429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:13,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:13,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2022-07-13 22:58:13,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826009993] [2022-07-13 22:58:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:13,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:58:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:13,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:58:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:13,127 INFO L87 Difference]: Start difference. First operand has 125 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:58:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:13,167 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2022-07-13 22:58:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:58:13,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-07-13 22:58:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:13,186 INFO L225 Difference]: With dead ends: 241 [2022-07-13 22:58:13,187 INFO L226 Difference]: Without dead ends: 120 [2022-07-13 22:58:13,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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:58:13,201 INFO L413 NwaCegarLoop]: 164 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, 164 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:58:13,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-13 22:58:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-13 22:58:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.275) internal successors, (102), 81 states have internal predecessors, (102), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-13 22:58:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2022-07-13 22:58:13,245 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 61 [2022-07-13 22:58:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:13,247 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2022-07-13 22:58:13,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:58:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2022-07-13 22:58:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 22:58:13,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:13,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:13,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 22:58:13,476 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,SelfDestructingSolverStorable0 [2022-07-13 22:58:13,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:13,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1156835566, now seen corresponding path program 1 times [2022-07-13 22:58:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:13,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043552630] [2022-07-13 22:58:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:13,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:13,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:13,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:13,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:13,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:13,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:58:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:13,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:13,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:58:13,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:13,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043552630] [2022-07-13 22:58:13,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043552630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:13,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243173025] [2022-07-13 22:58:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:13,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:13,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:13,821 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:58:13,842 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:58:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:14,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:58:14,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 22:58:14,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 22:58:14,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243173025] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:14,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:58:14,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 13 [2022-07-13 22:58:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678288147] [2022-07-13 22:58:14,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:14,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:58:14,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:14,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:58:14,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:58:14,446 INFO L87 Difference]: Start difference. First operand 120 states and 159 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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:58:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:14,649 INFO L93 Difference]: Finished difference Result 208 states and 282 transitions. [2022-07-13 22:58:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:58:14,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 61 [2022-07-13 22:58:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:14,652 INFO L225 Difference]: With dead ends: 208 [2022-07-13 22:58:14,652 INFO L226 Difference]: Without dead ends: 155 [2022-07-13 22:58:14,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:58:14,654 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 241 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:14,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 535 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-13 22:58:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2022-07-13 22:58:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 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:58:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 177 transitions. [2022-07-13 22:58:14,669 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 177 transitions. Word has length 61 [2022-07-13 22:58:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:14,670 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 177 transitions. [2022-07-13 22:58:14,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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:58:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-07-13 22:58:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 22:58:14,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:14,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:14,706 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:58:14,891 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,SelfDestructingSolverStorable1 [2022-07-13 22:58:14,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1751928336, now seen corresponding path program 1 times [2022-07-13 22:58:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:14,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270839738] [2022-07-13 22:58:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:58:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:58:15,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:15,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270839738] [2022-07-13 22:58:15,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270839738] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:15,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316868023] [2022-07-13 22:58:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:15,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:15,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:15,129 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:15,131 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:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:58:15,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 22:58:15,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:58:15,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316868023] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:58:15,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:58:15,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-07-13 22:58:15,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804805205] [2022-07-13 22:58:15,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:15,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:58:15,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:15,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:58:15,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:58:15,794 INFO L87 Difference]: Start difference. First operand 132 states and 177 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-13 22:58:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:16,001 INFO L93 Difference]: Finished difference Result 230 states and 312 transitions. [2022-07-13 22:58:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:58:16,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) Word has length 61 [2022-07-13 22:58:16,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:16,004 INFO L225 Difference]: With dead ends: 230 [2022-07-13 22:58:16,005 INFO L226 Difference]: Without dead ends: 135 [2022-07-13 22:58:16,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:58:16,006 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 336 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:16,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 584 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-13 22:58:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-13 22:58:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 92 states have internal predecessors, (114), 33 states have call successors, (33), 10 states have call predecessors, (33), 11 states have return successors, (34), 32 states have call predecessors, (34), 32 states have call successors, (34) [2022-07-13 22:58:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2022-07-13 22:58:16,020 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 61 [2022-07-13 22:58:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:16,020 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2022-07-13 22:58:16,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-13 22:58:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2022-07-13 22:58:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:58:16,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:16,024 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:16,060 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:16,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:16,252 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1531369667, now seen corresponding path program 1 times [2022-07-13 22:58:16,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:16,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732863921] [2022-07-13 22:58:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:58:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:58:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 22:58:16,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:16,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732863921] [2022-07-13 22:58:16,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732863921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:16,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:16,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:58:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226629749] [2022-07-13 22:58:16,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:16,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:58:16,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:16,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:58:16,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:58:16,575 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:58:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:16,610 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2022-07-13 22:58:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:58:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 65 [2022-07-13 22:58:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:16,613 INFO L225 Difference]: With dead ends: 233 [2022-07-13 22:58:16,613 INFO L226 Difference]: Without dead ends: 179 [2022-07-13 22:58:16,613 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:58:16,614 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 12 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:16,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 481 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-13 22:58:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-07-13 22:58:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 118 states have (on average 1.271186440677966) internal successors, (150), 120 states have internal predecessors, (150), 47 states have call successors, (47), 10 states have call predecessors, (47), 11 states have return successors, (50), 46 states have call predecessors, (50), 46 states have call successors, (50) [2022-07-13 22:58:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2022-07-13 22:58:16,631 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 65 [2022-07-13 22:58:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:16,632 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2022-07-13 22:58:16,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:58:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2022-07-13 22:58:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:58:16,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:16,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:16,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:58:16,635 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -84293126, now seen corresponding path program 1 times [2022-07-13 22:58:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296921907] [2022-07-13 22:58:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:58:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:58:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 22:58:16,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:16,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296921907] [2022-07-13 22:58:16,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296921907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:16,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:16,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:58:16,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663020532] [2022-07-13 22:58:16,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:16,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:58:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:58:16,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:58:16,940 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-13 22:58:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:17,007 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2022-07-13 22:58:17,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:58:17,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 65 [2022-07-13 22:58:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:17,011 INFO L225 Difference]: With dead ends: 188 [2022-07-13 22:58:17,011 INFO L226 Difference]: Without dead ends: 181 [2022-07-13 22:58:17,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:58:17,013 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:17,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1070 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-13 22:58:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-07-13 22:58:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 124 states have internal predecessors, (153), 47 states have call successors, (47), 10 states have call predecessors, (47), 12 states have return successors, (56), 46 states have call predecessors, (56), 46 states have call successors, (56) [2022-07-13 22:58:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2022-07-13 22:58:17,042 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 65 [2022-07-13 22:58:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:17,044 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2022-07-13 22:58:17,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-13 22:58:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2022-07-13 22:58:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 22:58:17,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:17,048 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:17,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:58:17,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:17,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1359362750, now seen corresponding path program 1 times [2022-07-13 22:58:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:17,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054078489] [2022-07-13 22:58:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:17,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:17,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:58:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:17,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:58:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:17,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 22:58:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:17,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054078489] [2022-07-13 22:58:17,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054078489] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:17,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643545644] [2022-07-13 22:58:17,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:17,460 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:17,461 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:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:17,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 2507 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 22:58:17,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 22:58:18,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:18,778 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 26 treesize of output 14 [2022-07-13 22:58:18,826 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:58:18,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-13 22:58:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:58:18,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643545644] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:58:18,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:58:18,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-07-13 22:58:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312341131] [2022-07-13 22:58:18,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:18,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 22:58:18,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:18,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 22:58:18,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:58:18,842 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:58:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:19,637 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2022-07-13 22:58:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:58:19,638 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 69 [2022-07-13 22:58:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:19,643 INFO L225 Difference]: With dead ends: 334 [2022-07-13 22:58:19,643 INFO L226 Difference]: Without dead ends: 306 [2022-07-13 22:58:19,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 133 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:58:19,647 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 96 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:19,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1856 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 383 Invalid, 0 Unknown, 141 Unchecked, 0.5s Time] [2022-07-13 22:58:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-13 22:58:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 270. [2022-07-13 22:58:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 188 states have internal predecessors, (238), 71 states have call successors, (71), 12 states have call predecessors, (71), 14 states have return successors, (82), 69 states have call predecessors, (82), 70 states have call successors, (82) [2022-07-13 22:58:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 391 transitions. [2022-07-13 22:58:19,683 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 391 transitions. Word has length 69 [2022-07-13 22:58:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:19,685 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 391 transitions. [2022-07-13 22:58:19,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:58:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 391 transitions. [2022-07-13 22:58:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 22:58:19,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:19,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:19,717 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:19,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:19,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:19,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:19,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1404727030, now seen corresponding path program 1 times [2022-07-13 22:58:19,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:19,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246051300] [2022-07-13 22:58:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:19,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:58:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:58:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:58:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 22:58:20,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:20,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246051300] [2022-07-13 22:58:20,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246051300] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:20,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382897973] [2022-07-13 22:58:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:20,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:20,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:20,213 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:20,214 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:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:58:20,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 22:58:20,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:20,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382897973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:20,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:20,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2022-07-13 22:58:20,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293022173] [2022-07-13 22:58:20,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:20,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:58:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:20,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:58:20,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:58:20,758 INFO L87 Difference]: Start difference. First operand 270 states and 391 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 22:58:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:20,914 INFO L93 Difference]: Finished difference Result 411 states and 598 transitions. [2022-07-13 22:58:20,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:58:20,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-07-13 22:58:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:20,917 INFO L225 Difference]: With dead ends: 411 [2022-07-13 22:58:20,917 INFO L226 Difference]: Without dead ends: 275 [2022-07-13 22:58:20,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:58:20,919 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:20,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1146 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-13 22:58:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-07-13 22:58:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 188 states have (on average 1.2872340425531914) internal successors, (242), 193 states have internal predecessors, (242), 71 states have call successors, (71), 12 states have call predecessors, (71), 15 states have return successors, (87), 69 states have call predecessors, (87), 70 states have call successors, (87) [2022-07-13 22:58:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 400 transitions. [2022-07-13 22:58:20,943 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 400 transitions. Word has length 73 [2022-07-13 22:58:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:20,943 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 400 transitions. [2022-07-13 22:58:20,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 22:58:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 400 transitions. [2022-07-13 22:58:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 22:58:20,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:20,945 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:20,978 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:21,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:21,168 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:21,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1686084061, now seen corresponding path program 1 times [2022-07-13 22:58:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:21,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933441289] [2022-07-13 22:58:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:58:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:58:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:58:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 22:58:21,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:21,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933441289] [2022-07-13 22:58:21,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933441289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:21,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:21,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:58:21,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217704407] [2022-07-13 22:58:21,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:21,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:58:21,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:21,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:58:21,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:21,370 INFO L87 Difference]: Start difference. First operand 275 states and 400 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 22:58:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:21,435 INFO L93 Difference]: Finished difference Result 397 states and 565 transitions. [2022-07-13 22:58:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:58:21,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2022-07-13 22:58:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:21,438 INFO L225 Difference]: With dead ends: 397 [2022-07-13 22:58:21,438 INFO L226 Difference]: Without dead ends: 296 [2022-07-13 22:58:21,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:58:21,439 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 35 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:21,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 688 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-07-13 22:58:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2022-07-13 22:58:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 183 states have (on average 1.2513661202185793) internal successors, (229), 188 states have internal predecessors, (229), 67 states have call successors, (67), 12 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2022-07-13 22:58:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2022-07-13 22:58:21,459 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 76 [2022-07-13 22:58:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:21,459 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2022-07-13 22:58:21,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 22:58:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2022-07-13 22:58:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 22:58:21,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:21,461 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:21,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:58:21,462 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1559219441, now seen corresponding path program 1 times [2022-07-13 22:58:21,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:21,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963871666] [2022-07-13 22:58:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:58:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:58:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:58:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 22:58:21,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:21,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963871666] [2022-07-13 22:58:21,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963871666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:21,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186539021] [2022-07-13 22:58:21,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:21,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:21,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:21,712 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:21,714 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:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:22,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:58:22,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 22:58:22,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:22,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186539021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:22,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:22,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-07-13 22:58:22,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383409145] [2022-07-13 22:58:22,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:22,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:58:22,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:22,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:58:22,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:58:22,222 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:58:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:22,380 INFO L93 Difference]: Finished difference Result 405 states and 571 transitions. [2022-07-13 22:58:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:58:22,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-07-13 22:58:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:22,383 INFO L225 Difference]: With dead ends: 405 [2022-07-13 22:58:22,383 INFO L226 Difference]: Without dead ends: 266 [2022-07-13 22:58:22,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:58:22,384 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 15 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:22,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 564 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-07-13 22:58:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-13 22:58:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-07-13 22:58:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 183 states have (on average 1.2459016393442623) internal successors, (228), 188 states have internal predecessors, (228), 67 states have call successors, (67), 12 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2022-07-13 22:58:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2022-07-13 22:58:22,403 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 75 [2022-07-13 22:58:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:22,403 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2022-07-13 22:58:22,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:58:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2022-07-13 22:58:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 22:58:22,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:22,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:22,436 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:22,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:22,620 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1115318767, now seen corresponding path program 1 times [2022-07-13 22:58:22,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:22,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738532822] [2022-07-13 22:58:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:22,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:22,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:22,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:23,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:23,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:23,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:58:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:23,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:58:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:23,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:58:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 22:58:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:23,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738532822] [2022-07-13 22:58:23,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738532822] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:23,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413266830] [2022-07-13 22:58:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:23,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:23,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:23,100 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:23,130 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:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:23,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 22:58:23,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:23,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:58:23,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:58:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 22:58:23,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:23,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413266830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:23,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:23,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-07-13 22:58:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926372996] [2022-07-13 22:58:23,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:23,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:58:23,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:23,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:58:23,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:58:23,979 INFO L87 Difference]: Start difference. First operand 266 states and 372 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 22:58:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:24,068 INFO L93 Difference]: Finished difference Result 422 states and 584 transitions. [2022-07-13 22:58:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:58:24,069 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2022-07-13 22:58:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:24,070 INFO L225 Difference]: With dead ends: 422 [2022-07-13 22:58:24,071 INFO L226 Difference]: Without dead ends: 273 [2022-07-13 22:58:24,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:58:24,072 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 46 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:24,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 704 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-07-13 22:58:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-13 22:58:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2022-07-13 22:58:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 187 states have (on average 1.2459893048128343) internal successors, (233), 191 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2022-07-13 22:58:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 377 transitions. [2022-07-13 22:58:24,110 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 377 transitions. Word has length 75 [2022-07-13 22:58:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:24,111 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 377 transitions. [2022-07-13 22:58:24,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 22:58:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 377 transitions. [2022-07-13 22:58:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 22:58:24,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:24,113 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:24,148 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:24,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:24,324 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:24,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1074644017, now seen corresponding path program 1 times [2022-07-13 22:58:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:24,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237052489] [2022-07-13 22:58:24,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:24,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:24,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:24,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:58:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:24,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:58:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:24,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:58:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:58:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 22:58:24,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:24,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237052489] [2022-07-13 22:58:24,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237052489] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:24,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560502683] [2022-07-13 22:58:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:24,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:24,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:24,508 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:24,510 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:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:24,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:58:24,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 22:58:24,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:24,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560502683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:24,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:24,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-13 22:58:24,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156148103] [2022-07-13 22:58:24,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:24,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:58:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:58:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:58:24,920 INFO L87 Difference]: Start difference. First operand 270 states and 377 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:58:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:24,953 INFO L93 Difference]: Finished difference Result 414 states and 578 transitions. [2022-07-13 22:58:24,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:58:24,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-07-13 22:58:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:24,956 INFO L225 Difference]: With dead ends: 414 [2022-07-13 22:58:24,956 INFO L226 Difference]: Without dead ends: 274 [2022-07-13 22:58:24,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:24,957 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 9 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:24,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 462 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-13 22:58:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2022-07-13 22:58:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 188 states have (on average 1.2393617021276595) internal successors, (233), 192 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (75), 65 states have call predecessors, (75), 66 states have call successors, (75) [2022-07-13 22:58:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 375 transitions. [2022-07-13 22:58:24,977 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 375 transitions. Word has length 75 [2022-07-13 22:58:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:24,977 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 375 transitions. [2022-07-13 22:58:24,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:58:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 375 transitions. [2022-07-13 22:58:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 22:58:24,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:24,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:25,011 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:25,195 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,SelfDestructingSolverStorable10 [2022-07-13 22:58:25,195 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:25,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:25,196 INFO L85 PathProgramCache]: Analyzing trace with hash -453034012, now seen corresponding path program 1 times [2022-07-13 22:58:25,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:25,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691010725] [2022-07-13 22:58:25,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:25,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:58:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:58:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:58:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 22:58:25,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:25,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691010725] [2022-07-13 22:58:25,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691010725] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:25,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929242709] [2022-07-13 22:58:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:25,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:25,459 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:25,461 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:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 22:58:25,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 22:58:26,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 22:58:26,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929242709] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:58:26,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:58:26,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2022-07-13 22:58:26,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195479497] [2022-07-13 22:58:26,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:26,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 22:58:26,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:26,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 22:58:26,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:58:26,140 INFO L87 Difference]: Start difference. First operand 271 states and 375 transitions. Second operand has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2022-07-13 22:58:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:26,501 INFO L93 Difference]: Finished difference Result 385 states and 522 transitions. [2022-07-13 22:58:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:58:26,502 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) Word has length 77 [2022-07-13 22:58:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:26,503 INFO L225 Difference]: With dead ends: 385 [2022-07-13 22:58:26,504 INFO L226 Difference]: Without dead ends: 292 [2022-07-13 22:58:26,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:58:26,505 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 406 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:26,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1241 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-07-13 22:58:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2022-07-13 22:58:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 186 states have (on average 1.2365591397849462) internal successors, (230), 189 states have internal predecessors, (230), 67 states have call successors, (67), 13 states have call predecessors, (67), 14 states have return successors, (73), 65 states have call predecessors, (73), 66 states have call successors, (73) [2022-07-13 22:58:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-13 22:58:26,524 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 77 [2022-07-13 22:58:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:26,524 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-13 22:58:26,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2022-07-13 22:58:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-13 22:58:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 22:58:26,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:26,526 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:26,557 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:26,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:26,754 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1814152958, now seen corresponding path program 1 times [2022-07-13 22:58:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:26,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679073125] [2022-07-13 22:58:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:58:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:58:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:58:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 22:58:26,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:26,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679073125] [2022-07-13 22:58:26,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679073125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:26,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:26,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:58:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85265552] [2022-07-13 22:58:26,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:26,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:58:26,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:26,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:58:26,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:58:26,993 INFO L87 Difference]: Start difference. First operand 268 states and 370 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 22:58:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:27,100 INFO L93 Difference]: Finished difference Result 360 states and 496 transitions. [2022-07-13 22:58:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:58:27,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 78 [2022-07-13 22:58:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:27,103 INFO L225 Difference]: With dead ends: 360 [2022-07-13 22:58:27,103 INFO L226 Difference]: Without dead ends: 290 [2022-07-13 22:58:27,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:58:27,104 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 54 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:27,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 827 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-13 22:58:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 263. [2022-07-13 22:58:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 183 states have (on average 1.2295081967213115) internal successors, (225), 187 states have internal predecessors, (225), 64 states have call successors, (64), 13 states have call predecessors, (64), 15 states have return successors, (73), 62 states have call predecessors, (73), 63 states have call successors, (73) [2022-07-13 22:58:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 362 transitions. [2022-07-13 22:58:27,124 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 362 transitions. Word has length 78 [2022-07-13 22:58:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:27,124 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 362 transitions. [2022-07-13 22:58:27,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 22:58:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 362 transitions. [2022-07-13 22:58:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 22:58:27,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:27,128 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:27,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 22:58:27,129 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:27,129 INFO L85 PathProgramCache]: Analyzing trace with hash 635447172, now seen corresponding path program 1 times [2022-07-13 22:58:27,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:27,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344195958] [2022-07-13 22:58:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:58:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:58:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:58:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 22:58:27,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:27,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344195958] [2022-07-13 22:58:27,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344195958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:27,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:27,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:58:27,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178898309] [2022-07-13 22:58:27,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:27,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:58:27,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:27,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:58:27,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:58:27,293 INFO L87 Difference]: Start difference. First operand 263 states and 362 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 22:58:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:27,322 INFO L93 Difference]: Finished difference Result 379 states and 518 transitions. [2022-07-13 22:58:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:58:27,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2022-07-13 22:58:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:27,324 INFO L225 Difference]: With dead ends: 379 [2022-07-13 22:58:27,324 INFO L226 Difference]: Without dead ends: 264 [2022-07-13 22:58:27,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:27,325 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 2 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:27,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 462 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-13 22:58:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2022-07-13 22:58:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 183 states have (on average 1.2240437158469946) internal successors, (224), 187 states have internal predecessors, (224), 64 states have call successors, (64), 13 states have call predecessors, (64), 15 states have return successors, (73), 62 states have call predecessors, (73), 63 states have call successors, (73) [2022-07-13 22:58:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 361 transitions. [2022-07-13 22:58:27,346 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 361 transitions. Word has length 78 [2022-07-13 22:58:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:27,347 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 361 transitions. [2022-07-13 22:58:27,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 22:58:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 361 transitions. [2022-07-13 22:58:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 22:58:27,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:27,349 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:27,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 22:58:27,350 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:27,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1294978694, now seen corresponding path program 1 times [2022-07-13 22:58:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:27,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544278488] [2022-07-13 22:58:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:27,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:58:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:58:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:58:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 22:58:27,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:27,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544278488] [2022-07-13 22:58:27,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544278488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:27,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:27,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:58:27,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948323283] [2022-07-13 22:58:27,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:27,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:58:27,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:27,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:58:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:27,541 INFO L87 Difference]: Start difference. First operand 263 states and 361 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 22:58:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:27,589 INFO L93 Difference]: Finished difference Result 334 states and 445 transitions. [2022-07-13 22:58:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:58:27,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2022-07-13 22:58:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:27,591 INFO L225 Difference]: With dead ends: 334 [2022-07-13 22:58:27,591 INFO L226 Difference]: Without dead ends: 263 [2022-07-13 22:58:27,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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:58:27,594 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 16 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:27,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 627 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-13 22:58:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2022-07-13 22:58:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 177 states have (on average 1.1977401129943503) internal successors, (212), 180 states have internal predecessors, (212), 62 states have call successors, (62), 13 states have call predecessors, (62), 14 states have return successors, (68), 60 states have call predecessors, (68), 61 states have call successors, (68) [2022-07-13 22:58:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 342 transitions. [2022-07-13 22:58:27,613 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 342 transitions. Word has length 78 [2022-07-13 22:58:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:27,614 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 342 transitions. [2022-07-13 22:58:27,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 22:58:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 342 transitions. [2022-07-13 22:58:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 22:58:27,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:27,616 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:27,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 22:58:27,617 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:27,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1823272801, now seen corresponding path program 1 times [2022-07-13 22:58:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:27,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702079420] [2022-07-13 22:58:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:58:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:58:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:58:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:58:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:58:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 22:58:27,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:27,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702079420] [2022-07-13 22:58:27,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702079420] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:27,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888509892] [2022-07-13 22:58:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:27,948 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:27,982 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:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 2523 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 22:58:28,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 22:58:28,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:29,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-13 22:58:29,255 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:58:29,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-13 22:58:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 22:58:29,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888509892] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:58:29,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:58:29,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-07-13 22:58:29,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896515413] [2022-07-13 22:58:29,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:29,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 22:58:29,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:29,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 22:58:29,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:58:29,270 INFO L87 Difference]: Start difference. First operand 254 states and 342 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 22:58:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:29,997 INFO L93 Difference]: Finished difference Result 371 states and 505 transitions. [2022-07-13 22:58:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 22:58:29,998 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 79 [2022-07-13 22:58:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:30,000 INFO L225 Difference]: With dead ends: 371 [2022-07-13 22:58:30,000 INFO L226 Difference]: Without dead ends: 318 [2022-07-13 22:58:30,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 16 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:58:30,001 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 196 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:30,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1250 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 351 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2022-07-13 22:58:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-07-13 22:58:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 253. [2022-07-13 22:58:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 176 states have (on average 1.1875) internal successors, (209), 179 states have internal predecessors, (209), 61 states have call successors, (61), 14 states have call predecessors, (61), 15 states have return successors, (66), 59 states have call predecessors, (66), 59 states have call successors, (66) [2022-07-13 22:58:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 336 transitions. [2022-07-13 22:58:30,025 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 336 transitions. Word has length 79 [2022-07-13 22:58:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:30,025 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 336 transitions. [2022-07-13 22:58:30,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 22:58:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 336 transitions. [2022-07-13 22:58:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 22:58:30,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:30,027 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:30,053 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:30,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 22:58:30,242 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:30,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1762517655, now seen corresponding path program 1 times [2022-07-13 22:58:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:30,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553801403] [2022-07-13 22:58:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:30,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:58:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:58:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:58:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:58:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:58:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 22:58:30,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553801403] [2022-07-13 22:58:30,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553801403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:30,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:30,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 22:58:30,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74975841] [2022-07-13 22:58:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:30,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:58:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:30,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:58:30,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:58:30,678 INFO L87 Difference]: Start difference. First operand 253 states and 336 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 22:58:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:31,510 INFO L93 Difference]: Finished difference Result 319 states and 428 transitions. [2022-07-13 22:58:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:58:31,511 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2022-07-13 22:58:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:31,513 INFO L225 Difference]: With dead ends: 319 [2022-07-13 22:58:31,513 INFO L226 Difference]: Without dead ends: 312 [2022-07-13 22:58:31,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:58:31,514 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 157 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:31,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 870 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:58:31,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-13 22:58:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 258. [2022-07-13 22:58:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 180 states have (on average 1.1833333333333333) internal successors, (213), 184 states have internal predecessors, (213), 61 states have call successors, (61), 14 states have call predecessors, (61), 16 states have return successors, (68), 59 states have call predecessors, (68), 59 states have call successors, (68) [2022-07-13 22:58:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 342 transitions. [2022-07-13 22:58:31,539 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 342 transitions. Word has length 86 [2022-07-13 22:58:31,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:31,540 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 342 transitions. [2022-07-13 22:58:31,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 22:58:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 342 transitions. [2022-07-13 22:58:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 22:58:31,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:31,542 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:31,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 22:58:31,542 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:31,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1504352217, now seen corresponding path program 1 times [2022-07-13 22:58:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:31,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935979911] [2022-07-13 22:58:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:31,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:58:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:58:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:58:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:58:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:58:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 22:58:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:31,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935979911] [2022-07-13 22:58:31,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935979911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:31,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:31,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:58:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977862076] [2022-07-13 22:58:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:31,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:58:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:31,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:58:31,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:31,767 INFO L87 Difference]: Start difference. First operand 258 states and 342 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:58:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:32,039 INFO L93 Difference]: Finished difference Result 377 states and 487 transitions. [2022-07-13 22:58:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:58:32,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 86 [2022-07-13 22:58:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:32,041 INFO L225 Difference]: With dead ends: 377 [2022-07-13 22:58:32,041 INFO L226 Difference]: Without dead ends: 251 [2022-07-13 22:58:32,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:58:32,042 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:32,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 358 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:32,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-13 22:58:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2022-07-13 22:58:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 172 states have (on average 1.180232558139535) internal successors, (203), 175 states have internal predecessors, (203), 61 states have call successors, (61), 14 states have call predecessors, (61), 15 states have return successors, (65), 59 states have call predecessors, (65), 59 states have call successors, (65) [2022-07-13 22:58:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 329 transitions. [2022-07-13 22:58:32,063 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 329 transitions. Word has length 86 [2022-07-13 22:58:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:32,063 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 329 transitions. [2022-07-13 22:58:32,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:58:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 329 transitions. [2022-07-13 22:58:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-13 22:58:32,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:32,065 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:32,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 22:58:32,065 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash 858492976, now seen corresponding path program 1 times [2022-07-13 22:58:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:32,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011227213] [2022-07-13 22:58:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:32,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 22:58:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 22:58:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:58:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:58:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:58:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:58:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:58:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 22:58:32,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:32,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011227213] [2022-07-13 22:58:32,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011227213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:32,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:32,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:58:32,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711591459] [2022-07-13 22:58:32,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:32,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:58:32,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:32,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:58:32,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:58:32,386 INFO L87 Difference]: Start difference. First operand 249 states and 329 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:58:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:33,029 INFO L93 Difference]: Finished difference Result 259 states and 338 transitions. [2022-07-13 22:58:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:58:33,029 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 88 [2022-07-13 22:58:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:33,031 INFO L225 Difference]: With dead ends: 259 [2022-07-13 22:58:33,031 INFO L226 Difference]: Without dead ends: 215 [2022-07-13 22:58:33,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:58:33,032 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 76 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:33,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1032 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:58:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-13 22:58:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 185. [2022-07-13 22:58:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.1627906976744187) internal successors, (150), 133 states have internal predecessors, (150), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2022-07-13 22:58:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2022-07-13 22:58:33,047 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 88 [2022-07-13 22:58:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:33,048 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2022-07-13 22:58:33,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:58:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2022-07-13 22:58:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 22:58:33,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:33,049 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1] [2022-07-13 22:58:33,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 22:58:33,050 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1641071482, now seen corresponding path program 1 times [2022-07-13 22:58:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:33,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757790291] [2022-07-13 22:58:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:33,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:58:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:58:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:58:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-13 22:58:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:33,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757790291] [2022-07-13 22:58:33,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757790291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:33,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340453237] [2022-07-13 22:58:33,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:33,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:33,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:33,491 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:33,492 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:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:33,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 22:58:33,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-13 22:58:34,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:34,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340453237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:34,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:34,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2022-07-13 22:58:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950807245] [2022-07-13 22:58:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:34,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:58:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:34,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:58:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:58:34,080 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-13 22:58:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:34,254 INFO L93 Difference]: Finished difference Result 223 states and 275 transitions. [2022-07-13 22:58:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:58:34,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 99 [2022-07-13 22:58:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:34,256 INFO L225 Difference]: With dead ends: 223 [2022-07-13 22:58:34,256 INFO L226 Difference]: Without dead ends: 185 [2022-07-13 22:58:34,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:58:34,257 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:34,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1198 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-13 22:58:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-13 22:58:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.1550387596899225) internal successors, (149), 133 states have internal predecessors, (149), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2022-07-13 22:58:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 232 transitions. [2022-07-13 22:58:34,274 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 232 transitions. Word has length 99 [2022-07-13 22:58:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:34,274 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 232 transitions. [2022-07-13 22:58:34,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-13 22:58:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 232 transitions. [2022-07-13 22:58:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 22:58:34,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:34,276 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1] [2022-07-13 22:58:34,307 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:34,503 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:34,503 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1774035915, now seen corresponding path program 1 times [2022-07-13 22:58:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:34,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560292439] [2022-07-13 22:58:34,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:34,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:34,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:58:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:58:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:58:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-13 22:58:35,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:35,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560292439] [2022-07-13 22:58:35,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560292439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:35,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903238234] [2022-07-13 22:58:35,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:35,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:35,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:35,026 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:35,028 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:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:35,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 2639 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 22:58:35,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-13 22:58:35,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:35,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903238234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:35,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:35,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2022-07-13 22:58:35,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114740747] [2022-07-13 22:58:35,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:35,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:58:35,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:35,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:58:35,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:58:35,577 INFO L87 Difference]: Start difference. First operand 185 states and 232 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:35,726 INFO L93 Difference]: Finished difference Result 279 states and 359 transitions. [2022-07-13 22:58:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:58:35,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 100 [2022-07-13 22:58:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:35,728 INFO L225 Difference]: With dead ends: 279 [2022-07-13 22:58:35,728 INFO L226 Difference]: Without dead ends: 216 [2022-07-13 22:58:35,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:58:35,729 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 19 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:35,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 728 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-13 22:58:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2022-07-13 22:58:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 139 states have internal predecessors, (153), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (50), 41 states have call predecessors, (50), 43 states have call successors, (50) [2022-07-13 22:58:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 247 transitions. [2022-07-13 22:58:35,745 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 247 transitions. Word has length 100 [2022-07-13 22:58:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:35,745 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 247 transitions. [2022-07-13 22:58:35,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 247 transitions. [2022-07-13 22:58:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 22:58:35,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:35,747 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1] [2022-07-13 22:58:35,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-13 22:58:35,963 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:35,963 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:35,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1103291491, now seen corresponding path program 1 times [2022-07-13 22:58:35,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:35,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447805940] [2022-07-13 22:58:35,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:35,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:58:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:58:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:58:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 22:58:36,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:36,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447805940] [2022-07-13 22:58:36,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447805940] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:36,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79983145] [2022-07-13 22:58:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:36,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:36,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:36,454 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:36,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 22:58:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:36,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 22:58:36,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 23 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 22:58:37,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:58:37,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79983145] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:37,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:58:37,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18, 7] total 27 [2022-07-13 22:58:37,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551788755] [2022-07-13 22:58:37,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:37,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:58:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:37,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:58:37,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:58:37,256 INFO L87 Difference]: Start difference. First operand 195 states and 247 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 22:58:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:37,504 INFO L93 Difference]: Finished difference Result 272 states and 342 transitions. [2022-07-13 22:58:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:58:37,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 109 [2022-07-13 22:58:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:37,506 INFO L225 Difference]: With dead ends: 272 [2022-07-13 22:58:37,506 INFO L226 Difference]: Without dead ends: 216 [2022-07-13 22:58:37,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2022-07-13 22:58:37,509 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 210 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:37,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 579 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:37,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-13 22:58:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2022-07-13 22:58:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 135 states have (on average 1.1185185185185185) internal successors, (151), 139 states have internal predecessors, (151), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (50), 41 states have call predecessors, (50), 43 states have call successors, (50) [2022-07-13 22:58:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 245 transitions. [2022-07-13 22:58:37,523 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 245 transitions. Word has length 109 [2022-07-13 22:58:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:37,524 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 245 transitions. [2022-07-13 22:58:37,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 22:58:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 245 transitions. [2022-07-13 22:58:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 22:58:37,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:37,525 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1] [2022-07-13 22:58:37,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:37,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 22:58:37,752 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:37,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2087155491, now seen corresponding path program 1 times [2022-07-13 22:58:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:37,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482214779] [2022-07-13 22:58:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:37,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:58:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:58:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:58:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:58:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 22:58:38,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:38,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482214779] [2022-07-13 22:58:38,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482214779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:38,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406010917] [2022-07-13 22:58:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:38,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:38,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:38,264 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:38,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 22:58:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:38,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 2662 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 22:58:38,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 22:58:38,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:38,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406010917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:38,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:38,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 25 [2022-07-13 22:58:38,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163797575] [2022-07-13 22:58:38,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:38,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:58:38,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:38,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:58:38,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:58:38,897 INFO L87 Difference]: Start difference. First operand 195 states and 245 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:58:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:39,041 INFO L93 Difference]: Finished difference Result 275 states and 330 transitions. [2022-07-13 22:58:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:58:39,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 109 [2022-07-13 22:58:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:39,043 INFO L225 Difference]: With dead ends: 275 [2022-07-13 22:58:39,043 INFO L226 Difference]: Without dead ends: 185 [2022-07-13 22:58:39,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-07-13 22:58:39,044 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 33 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:39,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1246 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-13 22:58:39,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-13 22:58:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.1085271317829457) internal successors, (143), 133 states have internal predecessors, (143), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2022-07-13 22:58:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2022-07-13 22:58:39,058 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 109 [2022-07-13 22:58:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:39,059 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2022-07-13 22:58:39,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-13 22:58:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2022-07-13 22:58:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 22:58:39,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:39,061 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1] [2022-07-13 22:58:39,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:39,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:39,268 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:39,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:39,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1526938213, now seen corresponding path program 1 times [2022-07-13 22:58:39,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:39,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627428550] [2022-07-13 22:58:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:39,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:58:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:58:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:58:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:58:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:39,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627428550] [2022-07-13 22:58:39,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627428550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:39,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:39,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:58:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068011256] [2022-07-13 22:58:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:39,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:58:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:39,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:58:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:58:39,523 INFO L87 Difference]: Start difference. First operand 185 states and 226 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:58:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:39,764 INFO L93 Difference]: Finished difference Result 223 states and 268 transitions. [2022-07-13 22:58:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:58:39,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2022-07-13 22:58:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:39,766 INFO L225 Difference]: With dead ends: 223 [2022-07-13 22:58:39,766 INFO L226 Difference]: Without dead ends: 166 [2022-07-13 22:58:39,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:58:39,767 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 93 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:39,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 310 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-13 22:58:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-13 22:58:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 119 states have internal predecessors, (127), 34 states have call successors, (34), 14 states have call predecessors, (34), 15 states have return successors, (37), 32 states have call predecessors, (37), 33 states have call successors, (37) [2022-07-13 22:58:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 198 transitions. [2022-07-13 22:58:39,781 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 198 transitions. Word has length 109 [2022-07-13 22:58:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:39,781 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 198 transitions. [2022-07-13 22:58:39,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 22:58:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 198 transitions. [2022-07-13 22:58:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 22:58:39,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:39,784 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:39,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 22:58:39,784 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2132558451, now seen corresponding path program 1 times [2022-07-13 22:58:39,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:39,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284429328] [2022-07-13 22:58:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:39,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:58:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:39,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:58:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:58:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:58:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:58:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-13 22:58:40,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:40,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284429328] [2022-07-13 22:58:40,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284429328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:40,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:40,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:58:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815625919] [2022-07-13 22:58:40,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:40,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:58:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:58:40,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:58:40,063 INFO L87 Difference]: Start difference. First operand 166 states and 198 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-13 22:58:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:40,367 INFO L93 Difference]: Finished difference Result 207 states and 243 transitions. [2022-07-13 22:58:40,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:58:40,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2022-07-13 22:58:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:40,369 INFO L225 Difference]: With dead ends: 207 [2022-07-13 22:58:40,369 INFO L226 Difference]: Without dead ends: 166 [2022-07-13 22:58:40,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:58:40,370 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 95 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:40,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 431 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:58:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-13 22:58:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-13 22:58:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 116 states have (on average 1.0862068965517242) internal successors, (126), 119 states have internal predecessors, (126), 34 states have call successors, (34), 14 states have call predecessors, (34), 15 states have return successors, (37), 32 states have call predecessors, (37), 33 states have call successors, (37) [2022-07-13 22:58:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 197 transitions. [2022-07-13 22:58:40,383 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 197 transitions. Word has length 134 [2022-07-13 22:58:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:40,383 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 197 transitions. [2022-07-13 22:58:40,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-13 22:58:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 197 transitions. [2022-07-13 22:58:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 22:58:40,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:40,384 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:40,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 22:58:40,385 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:40,385 INFO L85 PathProgramCache]: Analyzing trace with hash 284756267, now seen corresponding path program 1 times [2022-07-13 22:58:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:40,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789221053] [2022-07-13 22:58:40,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:58:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:58:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:58:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:58:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:58:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 22:58:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 22:58:40,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:40,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789221053] [2022-07-13 22:58:40,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789221053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:40,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000966892] [2022-07-13 22:58:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:40,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:40,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:40,871 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:40,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 22:58:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:41,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 2752 conjuncts, 101 conjunts are in the unsatisfiable core [2022-07-13 22:58:41,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 22:58:44,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:49,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000966892] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:49,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:58:49,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 44 [2022-07-13 22:58:49,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626536857] [2022-07-13 22:58:49,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:49,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-13 22:58:49,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:49,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-13 22:58:49,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2022-07-13 22:58:49,751 INFO L87 Difference]: Start difference. First operand 166 states and 197 transitions. Second operand has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2022-07-13 22:58:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:50,603 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-07-13 22:58:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:58:50,604 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) Word has length 135 [2022-07-13 22:58:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:50,604 INFO L225 Difference]: With dead ends: 181 [2022-07-13 22:58:50,604 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 22:58:50,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 143 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=287, Invalid=4405, Unknown=0, NotChecked=0, Total=4692 [2022-07-13 22:58:50,606 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:50,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 388 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 560 Invalid, 0 Unknown, 54 Unchecked, 0.4s Time] [2022-07-13 22:58:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 22:58:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 22:58:50,607 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:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 22:58:50,607 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2022-07-13 22:58:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:50,608 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 22:58:50,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2022-07-13 22:58:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 22:58:50,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 22:58:50,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 22:58:50,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:50,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-13 22:58:50,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 22:58:52,882 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |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) (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))) [2022-07-13 22:58:52,882 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:52,882 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |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) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2022-07-13 22:58:52,882 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-13 22:58:52,882 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (or .cse0 (<= (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ 18446744073709551615 .cse1 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616))) (+ .cse1 15)))) (= |old(#valid)| |#valid|)))) [2022-07-13 22:58:52,882 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-13 22:58:52,883 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |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) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2022-07-13 22:58:52,883 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-13 22:58:52,883 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |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:52,883 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (not (< 0 |#StackHeapBarrier|))) [2022-07-13 22:58:52,883 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-13 22:58:52,883 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-13 22:58:52,884 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |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:52,884 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-13 22:58:52,884 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:52,884 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-13 22:58:52,884 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-13 22:58:52,884 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-13 22:58:52,884 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-13 22:58:52,884 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-13 22:58:52,885 INFO L902 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2022-07-13 22:58:52,885 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-07-13 22:58:52,885 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-07-13 22:58:52,885 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-07-13 22:58:52,885 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-07-13 22:58:52,885 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-07-13 22:58:52,885 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-07-13 22:58:52,886 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-13 22:58:52,886 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-13 22:58:52,886 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-13 22:58:52,886 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:58:52,886 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-13 22:58:52,886 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-13 22:58:52,886 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:58:52,886 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-13 22:58:52,886 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-13 22:58:52,887 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-13 22:58:52,887 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-13 22:58:52,887 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:52,887 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:52,887 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:52,887 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-13 22:58:52,887 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:52,887 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-13 22:58:52,888 INFO L902 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7368 7372) the Hoare annotation is: true [2022-07-13 22:58:52,888 INFO L899 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2022-07-13 22:58:52,888 INFO L899 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2022-07-13 22:58:52,888 INFO L899 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2022-07-13 22:58:52,888 INFO L899 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2022-07-13 22:58:52,888 INFO L899 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2022-07-13 22:58:52,888 INFO L899 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2022-07-13 22:58:52,889 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2022-07-13 22:58:52,889 INFO L899 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2022-07-13 22:58:52,889 INFO L899 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2022-07-13 22:58:52,889 INFO L899 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2022-07-13 22:58:52,889 INFO L899 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2022-07-13 22:58:52,889 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2022-07-13 22:58:52,889 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-13 22:58:52,889 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-13 22:58:52,889 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-13 22:58:52,889 INFO L899 garLoopResultBuilder]: For program point L6675-1(line 6675) no Hoare annotation was computed. [2022-07-13 22:58:52,889 INFO L895 garLoopResultBuilder]: At program point L6675(line 6675) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:58:52,890 INFO L899 garLoopResultBuilder]: For program point L9549(lines 9549 9550) no Hoare annotation was computed. [2022-07-13 22:58:52,890 INFO L899 garLoopResultBuilder]: For program point L9549-2(lines 9549 9550) no Hoare annotation was computed. [2022-07-13 22:58:52,890 INFO L899 garLoopResultBuilder]: For program point L9549-3(lines 9549 9559) no Hoare annotation was computed. [2022-07-13 22:58:52,890 INFO L895 garLoopResultBuilder]: At program point L9549-4(lines 9549 9559) the Hoare annotation is: (let ((.cse1 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse2 (< 0 |#StackHeapBarrier|))) (or (and (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2))) [2022-07-13 22:58:52,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 22:58:52,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 22:58:52,890 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-13 22:58:52,890 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-13 22:58:52,891 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-13 22:58:52,891 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-13 22:58:52,891 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-13 22:58:52,891 INFO L895 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1360#1| 1) (<= 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1360#1|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:58:52,891 INFO L899 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2022-07-13 22:58:52,891 INFO L895 garLoopResultBuilder]: At program point L9329-4(line 9329) the Hoare annotation is: (let ((.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.offset| 0)) (.cse15 (not .cse7)) (.cse16 (not .cse9)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base| 0)) (.cse12 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse17 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (<= .cse18 (* (div .cse18 18446744073709551616) 18446744073709551616))) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse19 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse20 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse14 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse8 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse8) (and .cse0 .cse17 .cse1 (<= 0 (+ (* (div (* (- 1) .cse18) 18446744073709551616) 18446744073709551616) .cse18)) .cse15 .cse16 .cse3 .cse4 .cse11 .cse14 .cse5 .cse8) (and .cse9 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse10 .cse11 .cse19 .cse20 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse17 .cse2 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse10 .cse11 .cse19 .cse20 .cse14 .cse5 .cse6 .cse7 .cse8)))) [2022-07-13 22:58:52,892 INFO L899 garLoopResultBuilder]: For program point L9329-5(line 9329) no Hoare annotation was computed. [2022-07-13 22:58:52,892 INFO L899 garLoopResultBuilder]: For program point L9329(line 9329) no Hoare annotation was computed. [2022-07-13 22:58:52,892 INFO L895 garLoopResultBuilder]: At program point L9552(line 9552) the Hoare annotation is: false [2022-07-13 22:58:52,892 INFO L895 garLoopResultBuilder]: At program point L9329-2(line 9329) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (let ((.cse4 (not .cse13))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse8 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse9 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse10 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse11 (let ((.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0))) (or (and .cse13 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse14) (and (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1|) (or .cse4 (not .cse14)))))) (.cse12 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 (<= 0 (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616) .cse2))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse9 .cse10 .cse11 .cse12))))) [2022-07-13 22:58:52,892 INFO L895 garLoopResultBuilder]: At program point L9552-1(line 9552) the Hoare annotation is: false [2022-07-13 22:58:52,892 INFO L899 garLoopResultBuilder]: For program point L9329-3(line 9329) no Hoare annotation was computed. [2022-07-13 22:58:52,893 INFO L899 garLoopResultBuilder]: For program point L9552-2(line 9552) no Hoare annotation was computed. [2022-07-13 22:58:52,893 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse5 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-07-13 22:58:52,893 INFO L895 garLoopResultBuilder]: At program point L9544-1(line 9544) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1350#1| 0) (<= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1350#1|) .cse3 .cse6))) [2022-07-13 22:58:52,893 INFO L899 garLoopResultBuilder]: For program point L9544-2(line 9544) no Hoare annotation was computed. [2022-07-13 22:58:52,893 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-13 22:58:52,893 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-13 22:58:52,893 INFO L899 garLoopResultBuilder]: For program point L9330(line 9330) no Hoare annotation was computed. [2022-07-13 22:58:52,894 INFO L899 garLoopResultBuilder]: For program point L9330-5(line 9330) no Hoare annotation was computed. [2022-07-13 22:58:52,894 INFO L899 garLoopResultBuilder]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2022-07-13 22:58:52,894 INFO L895 garLoopResultBuilder]: At program point L9330-2(line 9330) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse1 (< 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse6 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse8 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse10 (< 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse11 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse12 (< 0 |#StackHeapBarrier|))) (or (and .cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) .cse1 (<= 0 (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616) .cse2))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-07-13 22:58:52,894 INFO L899 garLoopResultBuilder]: For program point L9330-3(line 9330) no Hoare annotation was computed. [2022-07-13 22:58:52,894 INFO L895 garLoopResultBuilder]: At program point L9330-4(line 9330) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse20 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (let ((.cse5 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse4 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse19 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.offset| 0)) (.cse18 (<= .cse20 (* (div .cse20 18446744073709551616) 18446744073709551616))) (.cse16 (not .cse10)) (.cse17 (not .cse0)) (.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse15 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse8 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse11 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse13 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse1 .cse14 .cse15 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse16 .cse17 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse14 .cse15 .cse2 .cse5 .cse6 .cse7 .cse8 .cse11) (and .cse12 .cse13 .cse18 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse14 .cse15 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse19 (<= 0 (+ (* (div (* (- 1) .cse20) 18446744073709551616) 18446744073709551616) .cse20)) .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse19 .cse13 .cse18 .cse16 .cse17 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse14 .cse15 .cse2 .cse7 .cse8 .cse11)))) [2022-07-13 22:58:52,894 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 22:58:52,895 INFO L902 garLoopResultBuilder]: At program point L9562(line 9562) the Hoare annotation is: true [2022-07-13 22:58:52,895 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2022-07-13 22:58:52,895 INFO L899 garLoopResultBuilder]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2022-07-13 22:58:52,895 INFO L895 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2022-07-13 22:58:52,895 INFO L899 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2022-07-13 22:58:52,895 INFO L899 garLoopResultBuilder]: For program point L9554-1(line 9554) no Hoare annotation was computed. [2022-07-13 22:58:52,895 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-13 22:58:52,896 INFO L895 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-07-13 22:58:52,896 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-13 22:58:52,896 INFO L899 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2022-07-13 22:58:52,896 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 22:58:52,896 INFO L899 garLoopResultBuilder]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2022-07-13 22:58:52,896 INFO L899 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2022-07-13 22:58:52,896 INFO L895 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-07-13 22:58:52,896 INFO L899 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2022-07-13 22:58:52,897 INFO L899 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2022-07-13 22:58:52,897 INFO L899 garLoopResultBuilder]: For program point L6673-3(lines 6673 6675) no Hoare annotation was computed. [2022-07-13 22:58:52,897 INFO L899 garLoopResultBuilder]: For program point L6673-1(lines 6673 6675) no Hoare annotation was computed. [2022-07-13 22:58:52,897 INFO L895 garLoopResultBuilder]: At program point L6673(line 6673) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:58:52,897 INFO L895 garLoopResultBuilder]: At program point L9349(line 9349) the Hoare annotation is: false [2022-07-13 22:58:52,897 INFO L899 garLoopResultBuilder]: For program point L9349-1(line 9349) no Hoare annotation was computed. [2022-07-13 22:58:52,897 INFO L895 garLoopResultBuilder]: At program point L9349-2(lines 9327 9350) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse5 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse6 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse7 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res#1| 0) (not .cse0) (not .cse1) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 (<= 0 (+ (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616) .cse8)) .cse3 .cse5 .cse6 .cse7))) (and (<= .cse8 (* (div .cse8 18446744073709551616) 18446744073709551616)) .cse6 .cse9 .cse0 .cse7) (and .cse1 .cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0) .cse3 .cse4 .cse5 .cse6 .cse9 .cse0 .cse7))) [2022-07-13 22:58:52,898 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-07-13 22:58:52,898 INFO L899 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2022-07-13 22:58:52,898 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-13 22:58:52,898 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-13 22:58:52,898 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-13 22:58:52,898 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:58:52,898 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:58:52,899 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-13 22:58:52,901 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:52,903 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 22:58:52,910 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:52,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:52,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:52,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:52,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 10:58:52 BoogieIcfgContainer [2022-07-13 22:58:52,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 22:58:52,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 22:58:52,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 22:58:52,930 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 22:58:52,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:58:11" (3/4) ... [2022-07-13 22:58:52,933 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 22:58:52,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:58:52,941 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-13 22:58:52,941 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2022-07-13 22:58:52,941 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-07-13 22:58:52,941 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-13 22:58:52,941 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-13 22:58:52,941 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-13 22:58:52,942 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-13 22:58:52,942 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-13 22:58:52,942 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-13 22:58:52,958 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2022-07-13 22:58:52,960 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-07-13 22:58:52,961 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-13 22:58:52,962 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-13 22:58:52,963 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-13 22:58:52,964 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 22:58:52,965 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 22:58:52,966 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 22:58:53,003 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0 && !(str == 0)) && !(str == 0)) && ((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) || (((((cursor == 0 && 0 <= -1 * unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown))) || ((((unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((((str == 0 && cursor == 0) && str == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2022-07-13 22:58:53,003 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) [2022-07-13 22:58:53,435 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 22:58:53,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 22:58:53,436 INFO L158 Benchmark]: Toolchain (without parser) took 46016.13ms. Allocated memory was 90.2MB in the beginning and 536.9MB in the end (delta: 446.7MB). Free memory was 47.8MB in the beginning and 209.7MB in the end (delta: -161.8MB). Peak memory consumption was 284.8MB. Max. memory is 16.1GB. [2022-07-13 22:58:53,436 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:58:53,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2552.66ms. Allocated memory was 90.2MB in the beginning and 180.4MB in the end (delta: 90.2MB). Free memory was 47.6MB in the beginning and 83.1MB in the end (delta: -35.5MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2022-07-13 22:58:53,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 192.07ms. Allocated memory is still 180.4MB. Free memory was 83.1MB in the beginning and 118.7MB in the end (delta: -35.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-07-13 22:58:53,437 INFO L158 Benchmark]: Boogie Preprocessor took 100.68ms. Allocated memory is still 180.4MB. Free memory was 118.7MB in the beginning and 111.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 22:58:53,437 INFO L158 Benchmark]: RCFGBuilder took 1400.24ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 77.4MB in the end (delta: 33.9MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2022-07-13 22:58:53,438 INFO L158 Benchmark]: TraceAbstraction took 41253.38ms. Allocated memory was 180.4MB in the beginning and 536.9MB in the end (delta: 356.5MB). Free memory was 76.3MB in the beginning and 340.7MB in the end (delta: -264.4MB). Peak memory consumption was 278.5MB. Max. memory is 16.1GB. [2022-07-13 22:58:53,438 INFO L158 Benchmark]: Witness Printer took 505.05ms. Allocated memory is still 536.9MB. Free memory was 340.7MB in the beginning and 209.7MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-13 22:58:53,439 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.20ms. Allocated memory is still 90.2MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2552.66ms. Allocated memory was 90.2MB in the beginning and 180.4MB in the end (delta: 90.2MB). Free memory was 47.6MB in the beginning and 83.1MB in the end (delta: -35.5MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 192.07ms. Allocated memory is still 180.4MB. Free memory was 83.1MB in the beginning and 118.7MB in the end (delta: -35.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.68ms. Allocated memory is still 180.4MB. Free memory was 118.7MB in the beginning and 111.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1400.24ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 77.4MB in the end (delta: 33.9MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * TraceAbstraction took 41253.38ms. Allocated memory was 180.4MB in the beginning and 536.9MB in the end (delta: 356.5MB). Free memory was 76.3MB in the beginning and 340.7MB in the end (delta: -264.4MB). Peak memory consumption was 278.5MB. Max. memory is 16.1GB. * Witness Printer took 505.05ms. Allocated memory is still 536.9MB. Free memory was 340.7MB in the beginning and 209.7MB 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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 41.2s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2480 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2334 mSDsluCounter, 19801 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 375 IncrementalHoareTripleChecker+Unchecked, 15916 mSDsCounter, 743 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5157 IncrementalHoareTripleChecker+Invalid, 6275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 743 mSolverCounterUnsat, 3885 mSDtfsCounter, 5157 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2575 GetRequests, 2142 SyntacticMatches, 34 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1904 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=7, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 351 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 502 PreInvPairs, 554 NumberOfFragments, 1562 HoareAnnotationTreeSize, 502 FomulaSimplifications, 717 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 42 FomulaSimplificationsInter, 19117 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 3459 NumberOfCodeBlocks, 3459 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3868 ConstructedInterpolants, 106 QuantifiedInterpolants, 16543 SizeOfPredicates, 117 NumberOfNonLiveVariables, 38463 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 47 InterpolantComputations, 21 PerfectInterpolantSequences, 1790/2063 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: 9327]: Loop Invariant [2022-07-13 22:58:53,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:53,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:53,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:53,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((\result == 0 && !(str == 0)) && !(str == 0)) && ((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) || (((((cursor == 0 && 0 <= -1 * unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown))) || ((((unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((((str == 0 && cursor == 0) && str == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: !(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) RESULT: Ultimate proved your program to be correct! [2022-07-13 22:58:53,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE