./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-18 01:22:20,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 01:22:20,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 01:22:20,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 01:22:20,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 01:22:20,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 01:22:20,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 01:22:20,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 01:22:20,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 01:22:20,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 01:22:20,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 01:22:20,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 01:22:20,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 01:22:20,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 01:22:20,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 01:22:20,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 01:22:20,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 01:22:20,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 01:22:20,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 01:22:20,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 01:22:20,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 01:22:20,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 01:22:20,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 01:22:20,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 01:22:20,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 01:22:20,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 01:22:20,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 01:22:20,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 01:22:20,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 01:22:20,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 01:22:20,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 01:22:20,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 01:22:20,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 01:22:20,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 01:22:20,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 01:22:20,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 01:22:20,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 01:22:20,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 01:22:20,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 01:22:20,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 01:22:20,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 01:22:20,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 01:22:20,355 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 01:22:20,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 01:22:20,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 01:22:20,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 01:22:20,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 01:22:20,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 01:22:20,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 01:22:20,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 01:22:20,359 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 01:22:20,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 01:22:20,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 01:22:20,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 01:22:20,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 01:22:20,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 01:22:20,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 01:22:20,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 01:22:20,361 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 01:22:20,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 01:22:20,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 01:22:20,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 01:22:20,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 01:22:20,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:22:20,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 01:22:20,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 01:22:20,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 01:22:20,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 01:22:20,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 01:22:20,363 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 01:22:20,363 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 01:22:20,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 01:22:20,364 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 01:22:20,364 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 [2021-12-18 01:22:20,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 01:22:20,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 01:22:20,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 01:22:20,641 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 01:22:20,642 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 01:22:20,643 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 [2021-12-18 01:22:20,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408232e93/3e8fd760c20c4d3b8bc1b640ba8c2ac3/FLAG4ac3029ec [2021-12-18 01:22:21,422 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 01:22:21,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2021-12-18 01:22:21,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408232e93/3e8fd760c20c4d3b8bc1b640ba8c2ac3/FLAG4ac3029ec [2021-12-18 01:22:21,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408232e93/3e8fd760c20c4d3b8bc1b640ba8c2ac3 [2021-12-18 01:22:21,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 01:22:21,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 01:22:21,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 01:22:21,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 01:22:21,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 01:22:21,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:22:21" (1/1) ... [2021-12-18 01:22:21,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756ff4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:21, skipping insertion in model container [2021-12-18 01:22:21,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:22:21" (1/1) ... [2021-12-18 01:22:21,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 01:22:21,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 01:22:22,107 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] [2021-12-18 01:22:22,113 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] [2021-12-18 01:22:23,033 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,034 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,036 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,037 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,038 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,053 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,055 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,057 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,059 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,364 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 01:22:23,365 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 01:22:23,366 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 01:22:23,367 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 01:22:23,371 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 01:22:23,374 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 01:22:23,374 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 01:22:23,375 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 01:22:23,376 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 01:22:23,377 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 01:22:23,505 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 01:22:23,607 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,617 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:22:23,762 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 01:22:23,785 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] [2021-12-18 01:22:23,786 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] [2021-12-18 01:22:23,819 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,822 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,823 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,823 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,824 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,832 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,833 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,833 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,834 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,869 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 01:22:23,870 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 01:22:23,870 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 01:22:23,870 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 01:22:23,871 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 01:22:23,871 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 01:22:23,872 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 01:22:23,872 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 01:22:23,873 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 01:22:23,873 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 01:22:23,907 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 01:22:23,974 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:23,974 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 01:22:24,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:22:24,242 INFO L208 MainTranslator]: Completed translation [2021-12-18 01:22:24,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24 WrapperNode [2021-12-18 01:22:24,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 01:22:24,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 01:22:24,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 01:22:24,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 01:22:24,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (1/1) ... [2021-12-18 01:22:24,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (1/1) ... [2021-12-18 01:22:24,437 INFO L137 Inliner]: procedures = 693, calls = 2789, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 869 [2021-12-18 01:22:24,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 01:22:24,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 01:22:24,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 01:22:24,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 01:22:24,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (1/1) ... [2021-12-18 01:22:24,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (1/1) ... [2021-12-18 01:22:24,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (1/1) ... [2021-12-18 01:22:24,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (1/1) ... [2021-12-18 01:22:24,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (1/1) ... [2021-12-18 01:22:24,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (1/1) ... [2021-12-18 01:22:24,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (1/1) ... [2021-12-18 01:22:24,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 01:22:24,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 01:22:24,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 01:22:24,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 01:22:24,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (1/1) ... [2021-12-18 01:22:24,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:22:24,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:24,599 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) [2021-12-18 01:22:24,618 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 [2021-12-18 01:22:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2021-12-18 01:22:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2021-12-18 01:22:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-12-18 01:22:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-12-18 01:22:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2021-12-18 01:22:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2021-12-18 01:22:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-18 01:22:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 01:22:24,640 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-18 01:22:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-18 01:22:24,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 01:22:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-18 01:22:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-18 01:22:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 01:22:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 01:22:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 01:22:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 01:22:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 01:22:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-18 01:22:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-18 01:22:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 01:22:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 01:22:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 01:22:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 01:22:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 01:22:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2021-12-18 01:22:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2021-12-18 01:22:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 01:22:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-18 01:22:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-18 01:22:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-18 01:22:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-18 01:22:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 01:22:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 01:22:24,932 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 01:22:24,934 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 01:22:25,602 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 01:22:25,611 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 01:22:25,611 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-18 01:22:25,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:22:25 BoogieIcfgContainer [2021-12-18 01:22:25,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 01:22:25,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 01:22:25,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 01:22:25,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 01:22:25,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:22:21" (1/3) ... [2021-12-18 01:22:25,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e95d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:22:25, skipping insertion in model container [2021-12-18 01:22:25,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:24" (2/3) ... [2021-12-18 01:22:25,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e95d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:22:25, skipping insertion in model container [2021-12-18 01:22:25,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:22:25" (3/3) ... [2021-12-18 01:22:25,623 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2021-12-18 01:22:25,628 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 01:22:25,628 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 01:22:25,680 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 01:22:25,688 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 01:22:25,688 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 01:22:25,707 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) [2021-12-18 01:22:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-18 01:22:25,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:25,714 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:25,715 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:25,719 INFO L85 PathProgramCache]: Analyzing trace with hash -386411024, now seen corresponding path program 1 times [2021-12-18 01:22:25,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:25,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454405445] [2021-12-18 01:22:25,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:25,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:26,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:22:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:26,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 01:22:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 01:22:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:26,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:22:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:26,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 01:22:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-18 01:22:26,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:26,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454405445] [2021-12-18 01:22:26,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454405445] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:26,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227955765] [2021-12-18 01:22:26,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:26,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:26,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:26,403 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) [2021-12-18 01:22:26,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 01:22:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:26,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-18 01:22:26,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 01:22:26,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:22:26,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227955765] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:26,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:22:26,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2021-12-18 01:22:26,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394343335] [2021-12-18 01:22:26,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:26,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 01:22:26,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:27,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 01:22:27,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:22:27,006 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) [2021-12-18 01:22:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:27,038 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2021-12-18 01:22:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 01:22:27,040 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 [2021-12-18 01:22:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:27,048 INFO L225 Difference]: With dead ends: 241 [2021-12-18 01:22:27,048 INFO L226 Difference]: Without dead ends: 120 [2021-12-18 01:22:27,052 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:22:27,055 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:22:27,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:22:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-18 01:22:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-12-18 01:22:27,092 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) [2021-12-18 01:22:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2021-12-18 01:22:27,095 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 61 [2021-12-18 01:22:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:27,097 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2021-12-18 01:22:27,097 INFO L471 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) [2021-12-18 01:22:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2021-12-18 01:22:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-18 01:22:27,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:27,101 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:27,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:27,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-18 01:22:27,315 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1156835566, now seen corresponding path program 1 times [2021-12-18 01:22:27,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:27,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121303613] [2021-12-18 01:22:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:27,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:27,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:27,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:27,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:22:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:27,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 01:22:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:27,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 01:22:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:27,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:22:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:27,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 01:22:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-18 01:22:27,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121303613] [2021-12-18 01:22:27,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121303613] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573106580] [2021-12-18 01:22:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:27,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:27,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:27,563 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) [2021-12-18 01:22:27,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 01:22:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:27,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 01:22:28,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-18 01:22:28,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:22:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-18 01:22:28,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573106580] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:28,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:22:28,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 13 [2021-12-18 01:22:28,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101416424] [2021-12-18 01:22:28,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:28,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:22:28,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:28,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:22:28,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:22:28,385 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) [2021-12-18 01:22:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:28,628 INFO L93 Difference]: Finished difference Result 208 states and 282 transitions. [2021-12-18 01:22:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:22:28,629 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 [2021-12-18 01:22:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:28,631 INFO L225 Difference]: With dead ends: 208 [2021-12-18 01:22:28,631 INFO L226 Difference]: Without dead ends: 155 [2021-12-18 01:22:28,632 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:22:28,633 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 241 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:28,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 548 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:22:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-18 01:22:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2021-12-18 01:22:28,660 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) [2021-12-18 01:22:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 177 transitions. [2021-12-18 01:22:28,663 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 177 transitions. Word has length 61 [2021-12-18 01:22:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:28,664 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 177 transitions. [2021-12-18 01:22:28,664 INFO L471 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) [2021-12-18 01:22:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2021-12-18 01:22:28,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-18 01:22:28,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:28,667 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:28,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:28,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-12-18 01:22:28,868 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1751928336, now seen corresponding path program 1 times [2021-12-18 01:22:28,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:28,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650184609] [2021-12-18 01:22:28,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:28,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:29,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:29,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:29,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:29,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 01:22:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 01:22:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:29,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 01:22:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:22:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 01:22:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-18 01:22:29,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:29,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650184609] [2021-12-18 01:22:29,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650184609] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:29,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493458707] [2021-12-18 01:22:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:29,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:29,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:29,112 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) [2021-12-18 01:22:29,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 01:22:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:29,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 01:22:29,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 01:22:29,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:22:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-18 01:22:29,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493458707] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:22:29,916 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:22:29,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2021-12-18 01:22:29,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385505727] [2021-12-18 01:22:29,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:22:29,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 01:22:29,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:29,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 01:22:29,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-18 01:22:29,918 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) [2021-12-18 01:22:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:30,119 INFO L93 Difference]: Finished difference Result 230 states and 312 transitions. [2021-12-18 01:22:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:22:30,120 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 [2021-12-18 01:22:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:30,123 INFO L225 Difference]: With dead ends: 230 [2021-12-18 01:22:30,123 INFO L226 Difference]: Without dead ends: 135 [2021-12-18 01:22:30,124 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:22:30,125 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 336 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:30,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 588 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:22:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-18 01:22:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-12-18 01:22:30,146 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) [2021-12-18 01:22:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2021-12-18 01:22:30,148 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 61 [2021-12-18 01:22:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:30,149 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2021-12-18 01:22:30,149 INFO L471 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) [2021-12-18 01:22:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2021-12-18 01:22:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-18 01:22:30,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:30,152 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:30,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:30,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:30,360 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:30,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1531369667, now seen corresponding path program 1 times [2021-12-18 01:22:30,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:30,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384940328] [2021-12-18 01:22:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:30,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:22:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:22:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 01:22:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 01:22:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 01:22:30,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:30,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384940328] [2021-12-18 01:22:30,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384940328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:30,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:22:30,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 01:22:30,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336416409] [2021-12-18 01:22:30,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:30,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:22:30,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:22:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 01:22:30,623 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) [2021-12-18 01:22:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:30,649 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2021-12-18 01:22:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 01:22:30,649 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 [2021-12-18 01:22:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:30,652 INFO L225 Difference]: With dead ends: 233 [2021-12-18 01:22:30,652 INFO L226 Difference]: Without dead ends: 179 [2021-12-18 01:22:30,652 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:22:30,653 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 12 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:30,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 482 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:22:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-18 01:22:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2021-12-18 01:22:30,669 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) [2021-12-18 01:22:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2021-12-18 01:22:30,671 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 65 [2021-12-18 01:22:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:30,672 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2021-12-18 01:22:30,672 INFO L471 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) [2021-12-18 01:22:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2021-12-18 01:22:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-18 01:22:30,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:30,674 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:30,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 01:22:30,675 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:30,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash -84293126, now seen corresponding path program 1 times [2021-12-18 01:22:30,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:30,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163794326] [2021-12-18 01:22:30,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:30,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:22:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:22:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 01:22:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:30,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 01:22:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-18 01:22:31,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:31,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163794326] [2021-12-18 01:22:31,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163794326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:31,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:22:31,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 01:22:31,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243343870] [2021-12-18 01:22:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:31,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 01:22:31,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:31,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 01:22:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 01:22:31,025 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) [2021-12-18 01:22:31,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:31,091 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2021-12-18 01:22:31,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:22:31,092 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 [2021-12-18 01:22:31,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:31,096 INFO L225 Difference]: With dead ends: 188 [2021-12-18 01:22:31,096 INFO L226 Difference]: Without dead ends: 181 [2021-12-18 01:22:31,097 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:22:31,099 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:31,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1078 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:22:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-18 01:22:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-12-18 01:22:31,132 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) [2021-12-18 01:22:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2021-12-18 01:22:31,135 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 65 [2021-12-18 01:22:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:31,136 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2021-12-18 01:22:31,136 INFO L471 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) [2021-12-18 01:22:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2021-12-18 01:22:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 01:22:31,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:31,141 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:31,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 01:22:31,142 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1359362750, now seen corresponding path program 1 times [2021-12-18 01:22:31,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:31,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416223563] [2021-12-18 01:22:31,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:31,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:31,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:31,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:31,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:31,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:31,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:22:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:31,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:22:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:31,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 01:22:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:31,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 01:22:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-18 01:22:31,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:31,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416223563] [2021-12-18 01:22:31,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416223563] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:31,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005168077] [2021-12-18 01:22:31,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:31,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:31,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:31,611 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) [2021-12-18 01:22:31,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-18 01:22:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:32,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 2507 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-18 01:22:32,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-18 01:22:32,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:22:33,143 INFO L388 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 [2021-12-18 01:22:33,182 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-18 01:22:33,183 INFO L388 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 [2021-12-18 01:22:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-18 01:22:33,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005168077] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:22:33,209 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:22:33,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2021-12-18 01:22:33,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41679569] [2021-12-18 01:22:33,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:22:33,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-18 01:22:33,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:33,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-18 01:22:33,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-12-18 01:22:33,212 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) [2021-12-18 01:22:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:33,938 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2021-12-18 01:22:33,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 01:22:33,939 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 [2021-12-18 01:22:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:33,941 INFO L225 Difference]: With dead ends: 334 [2021-12-18 01:22:33,941 INFO L226 Difference]: Without dead ends: 306 [2021-12-18 01:22:33,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 130 SyntacticMatches, 15 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-12-18 01:22:33,943 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 96 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:33,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1862 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 380 Invalid, 0 Unknown, 140 Unchecked, 0.4s Time] [2021-12-18 01:22:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-18 01:22:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 270. [2021-12-18 01:22:33,968 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) [2021-12-18 01:22:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 391 transitions. [2021-12-18 01:22:33,972 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 391 transitions. Word has length 69 [2021-12-18 01:22:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:33,974 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 391 transitions. [2021-12-18 01:22:33,974 INFO L471 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) [2021-12-18 01:22:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 391 transitions. [2021-12-18 01:22:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-18 01:22:33,976 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:33,976 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:34,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-18 01:22:34,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:34,191 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:34,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1404727030, now seen corresponding path program 1 times [2021-12-18 01:22:34,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:34,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261807131] [2021-12-18 01:22:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:34,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:34,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:34,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 01:22:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-18 01:22:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 01:22:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-18 01:22:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:34,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 01:22:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 01:22:34,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:34,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261807131] [2021-12-18 01:22:34,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261807131] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:34,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559443237] [2021-12-18 01:22:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:34,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:34,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:34,479 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) [2021-12-18 01:22:34,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-18 01:22:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:34,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-18 01:22:34,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 01:22:35,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:22:35,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559443237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:35,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:22:35,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2021-12-18 01:22:35,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144173963] [2021-12-18 01:22:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:35,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 01:22:35,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:35,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 01:22:35,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:22:35,050 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) [2021-12-18 01:22:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:35,169 INFO L93 Difference]: Finished difference Result 411 states and 598 transitions. [2021-12-18 01:22:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 01:22:35,170 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 [2021-12-18 01:22:35,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:35,171 INFO L225 Difference]: With dead ends: 411 [2021-12-18 01:22:35,172 INFO L226 Difference]: Without dead ends: 275 [2021-12-18 01:22:35,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:22:35,173 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:35,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1155 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:22:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-18 01:22:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-12-18 01:22:35,189 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) [2021-12-18 01:22:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 400 transitions. [2021-12-18 01:22:35,191 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 400 transitions. Word has length 73 [2021-12-18 01:22:35,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:35,191 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 400 transitions. [2021-12-18 01:22:35,192 INFO L471 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) [2021-12-18 01:22:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 400 transitions. [2021-12-18 01:22:35,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-18 01:22:35,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:35,194 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:35,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:35,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:35,411 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1686084061, now seen corresponding path program 1 times [2021-12-18 01:22:35,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:35,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789056327] [2021-12-18 01:22:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:35,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:22:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:22:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 01:22:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 01:22:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:22:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-18 01:22:35,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:35,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789056327] [2021-12-18 01:22:35,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789056327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:35,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:22:35,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:22:35,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869457914] [2021-12-18 01:22:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:35,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:22:35,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:35,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:22:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:22:35,637 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) [2021-12-18 01:22:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:35,693 INFO L93 Difference]: Finished difference Result 397 states and 565 transitions. [2021-12-18 01:22:35,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:22:35,693 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 [2021-12-18 01:22:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:35,696 INFO L225 Difference]: With dead ends: 397 [2021-12-18 01:22:35,696 INFO L226 Difference]: Without dead ends: 296 [2021-12-18 01:22:35,697 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:22:35,700 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 35 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:35,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 692 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:22:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-12-18 01:22:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2021-12-18 01:22:35,722 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) [2021-12-18 01:22:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2021-12-18 01:22:35,724 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 76 [2021-12-18 01:22:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:35,724 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2021-12-18 01:22:35,724 INFO L471 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) [2021-12-18 01:22:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2021-12-18 01:22:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 01:22:35,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:35,726 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:35,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 01:22:35,726 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:35,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1559219441, now seen corresponding path program 1 times [2021-12-18 01:22:35,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:35,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257603027] [2021-12-18 01:22:35,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:35,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:22:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 01:22:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:22:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 01:22:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 01:22:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-18 01:22:35,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:35,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257603027] [2021-12-18 01:22:35,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257603027] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:35,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541544667] [2021-12-18 01:22:35,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:35,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:35,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:35,969 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) [2021-12-18 01:22:35,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-18 01:22:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:36,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 01:22:36,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-18 01:22:36,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:22:36,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541544667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:36,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:22:36,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2021-12-18 01:22:36,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702194573] [2021-12-18 01:22:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:36,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:22:36,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:36,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:22:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:22:36,595 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) [2021-12-18 01:22:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:36,748 INFO L93 Difference]: Finished difference Result 405 states and 571 transitions. [2021-12-18 01:22:36,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:22:36,748 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 [2021-12-18 01:22:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:36,750 INFO L225 Difference]: With dead ends: 405 [2021-12-18 01:22:36,750 INFO L226 Difference]: Without dead ends: 266 [2021-12-18 01:22:36,751 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:22:36,752 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:22:36,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 564 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2021-12-18 01:22:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-18 01:22:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-12-18 01:22:36,767 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) [2021-12-18 01:22:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2021-12-18 01:22:36,769 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 75 [2021-12-18 01:22:36,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:36,769 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2021-12-18 01:22:36,770 INFO L471 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) [2021-12-18 01:22:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2021-12-18 01:22:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 01:22:36,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:36,771 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:36,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:36,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:36,990 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:36,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1115318767, now seen corresponding path program 1 times [2021-12-18 01:22:36,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:36,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392284363] [2021-12-18 01:22:36,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:36,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:37,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:37,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:37,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:22:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 01:22:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:22:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:37,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 01:22:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 01:22:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-18 01:22:37,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:37,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392284363] [2021-12-18 01:22:37,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392284363] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:37,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736075674] [2021-12-18 01:22:37,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:37,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:37,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:37,443 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) [2021-12-18 01:22:37,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 01:22:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:37,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 01:22:37,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:37,947 INFO L388 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 [2021-12-18 01:22:37,952 INFO L388 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 [2021-12-18 01:22:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-18 01:22:38,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:22:38,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736075674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:38,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:22:38,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2021-12-18 01:22:38,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89017836] [2021-12-18 01:22:38,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:38,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 01:22:38,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:38,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 01:22:38,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-12-18 01:22:38,402 INFO L87 Difference]: Start difference. First operand 266 states and 372 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 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) [2021-12-18 01:22:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:38,487 INFO L93 Difference]: Finished difference Result 529 states and 742 transitions. [2021-12-18 01:22:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 01:22:38,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 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 [2021-12-18 01:22:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:38,490 INFO L225 Difference]: With dead ends: 529 [2021-12-18 01:22:38,491 INFO L226 Difference]: Without dead ends: 373 [2021-12-18 01:22:38,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-12-18 01:22:38,492 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 54 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:38,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 1232 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 68 Unchecked, 0.0s Time] [2021-12-18 01:22:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-12-18 01:22:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 276. [2021-12-18 01:22:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 192 states have (on average 1.2395833333333333) internal successors, (238), 197 states have internal predecessors, (238), 67 states have call successors, (67), 13 states have call predecessors, (67), 16 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2021-12-18 01:22:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 382 transitions. [2021-12-18 01:22:38,512 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 382 transitions. Word has length 75 [2021-12-18 01:22:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:38,513 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 382 transitions. [2021-12-18 01:22:38,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 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) [2021-12-18 01:22:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 382 transitions. [2021-12-18 01:22:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 01:22:38,515 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:38,515 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:38,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:38,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:38,736 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:38,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:38,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1074644017, now seen corresponding path program 1 times [2021-12-18 01:22:38,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:38,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968558026] [2021-12-18 01:22:38,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:38,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:38,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:38,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:38,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:22:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 01:22:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:22:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 01:22:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:38,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 01:22:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 01:22:38,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:38,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968558026] [2021-12-18 01:22:38,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968558026] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:38,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715451833] [2021-12-18 01:22:38,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:38,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:38,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:38,884 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) [2021-12-18 01:22:38,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 01:22:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:22:39,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-18 01:22:39,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:22:39,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715451833] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:39,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:22:39,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-12-18 01:22:39,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499869958] [2021-12-18 01:22:39,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:39,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:22:39,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:39,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:22:39,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 01:22:39,410 INFO L87 Difference]: Start difference. First operand 276 states and 382 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) [2021-12-18 01:22:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:39,438 INFO L93 Difference]: Finished difference Result 420 states and 583 transitions. [2021-12-18 01:22:39,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:22:39,438 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 [2021-12-18 01:22:39,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:39,440 INFO L225 Difference]: With dead ends: 420 [2021-12-18 01:22:39,440 INFO L226 Difference]: Without dead ends: 278 [2021-12-18 01:22:39,441 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:22:39,442 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 6 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:39,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 465 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:22:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-18 01:22:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 275. [2021-12-18 01:22:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 191 states have (on average 1.2356020942408377) internal successors, (236), 196 states have internal predecessors, (236), 67 states have call successors, (67), 13 states have call predecessors, (67), 16 states have return successors, (75), 65 states have call predecessors, (75), 66 states have call successors, (75) [2021-12-18 01:22:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 378 transitions. [2021-12-18 01:22:39,458 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 378 transitions. Word has length 75 [2021-12-18 01:22:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:39,458 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 378 transitions. [2021-12-18 01:22:39,458 INFO L471 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) [2021-12-18 01:22:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 378 transitions. [2021-12-18 01:22:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-18 01:22:39,460 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:39,460 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:39,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-18 01:22:39,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-18 01:22:39,679 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:39,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash -453034012, now seen corresponding path program 1 times [2021-12-18 01:22:39,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:39,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990842092] [2021-12-18 01:22:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:39,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:22:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:22:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 01:22:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 01:22:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:22:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-18 01:22:39,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:39,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990842092] [2021-12-18 01:22:39,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990842092] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:39,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239850673] [2021-12-18 01:22:39,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:39,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:39,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:39,941 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) [2021-12-18 01:22:39,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 01:22:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:40,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 01:22:40,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-18 01:22:40,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:22:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-18 01:22:40,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239850673] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:22:40,741 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:22:40,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2021-12-18 01:22:40,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677869117] [2021-12-18 01:22:40,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:22:40,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-18 01:22:40,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:40,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-18 01:22:40,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-12-18 01:22:40,743 INFO L87 Difference]: Start difference. First operand 275 states and 378 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 10 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2021-12-18 01:22:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:41,023 INFO L93 Difference]: Finished difference Result 389 states and 525 transitions. [2021-12-18 01:22:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 01:22:41,024 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 10 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) Word has length 77 [2021-12-18 01:22:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:41,025 INFO L225 Difference]: With dead ends: 389 [2021-12-18 01:22:41,025 INFO L226 Difference]: Without dead ends: 296 [2021-12-18 01:22:41,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2021-12-18 01:22:41,026 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 352 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:41,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 901 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 01:22:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-12-18 01:22:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 272. [2021-12-18 01:22:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 189 states have (on average 1.2328042328042328) internal successors, (233), 193 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (73), 65 states have call predecessors, (73), 66 states have call successors, (73) [2021-12-18 01:22:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 373 transitions. [2021-12-18 01:22:41,043 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 373 transitions. Word has length 77 [2021-12-18 01:22:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:41,043 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 373 transitions. [2021-12-18 01:22:41,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 10 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2021-12-18 01:22:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 373 transitions. [2021-12-18 01:22:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-18 01:22:41,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:41,046 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:41,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:41,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:41,259 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:41,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1814152958, now seen corresponding path program 1 times [2021-12-18 01:22:41,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:41,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048568003] [2021-12-18 01:22:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:41,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:22:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:22:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 01:22:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 01:22:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 01:22:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-18 01:22:41,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:41,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048568003] [2021-12-18 01:22:41,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048568003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:41,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:22:41,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:22:41,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737768539] [2021-12-18 01:22:41,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:41,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:22:41,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:22:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:22:41,468 INFO L87 Difference]: Start difference. First operand 272 states and 373 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) [2021-12-18 01:22:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:41,503 INFO L93 Difference]: Finished difference Result 348 states and 468 transitions. [2021-12-18 01:22:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:22:41,504 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 [2021-12-18 01:22:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:41,505 INFO L225 Difference]: With dead ends: 348 [2021-12-18 01:22:41,505 INFO L226 Difference]: Without dead ends: 272 [2021-12-18 01:22:41,506 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:22:41,507 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 18 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:41,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 634 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:22:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-18 01:22:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2021-12-18 01:22:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 185 states have (on average 1.2054054054054053) internal successors, (223), 189 states have internal predecessors, (223), 65 states have call successors, (65), 13 states have call predecessors, (65), 15 states have return successors, (71), 63 states have call predecessors, (71), 64 states have call successors, (71) [2021-12-18 01:22:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 359 transitions. [2021-12-18 01:22:41,521 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 359 transitions. Word has length 78 [2021-12-18 01:22:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:41,521 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 359 transitions. [2021-12-18 01:22:41,522 INFO L471 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) [2021-12-18 01:22:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 359 transitions. [2021-12-18 01:22:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-18 01:22:41,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:41,523 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:41,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 01:22:41,524 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1823272801, now seen corresponding path program 1 times [2021-12-18 01:22:41,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:41,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799779834] [2021-12-18 01:22:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:41,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 01:22:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:22:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:22:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 01:22:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 01:22:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:22:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-18 01:22:41,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:41,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799779834] [2021-12-18 01:22:41,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799779834] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:41,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839004395] [2021-12-18 01:22:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:41,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:41,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:41,859 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) [2021-12-18 01:22:41,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 01:22:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:42,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 2523 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 01:22:42,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-18 01:22:43,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:22:43,281 INFO L388 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 [2021-12-18 01:22:43,328 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-18 01:22:43,328 INFO L388 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 [2021-12-18 01:22:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-18 01:22:43,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839004395] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:22:43,365 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:22:43,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2021-12-18 01:22:43,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273848211] [2021-12-18 01:22:43,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:22:43,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-18 01:22:43,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:43,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-18 01:22:43,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-12-18 01:22:43,368 INFO L87 Difference]: Start difference. First operand 266 states and 359 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) [2021-12-18 01:22:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:43,976 INFO L93 Difference]: Finished difference Result 356 states and 478 transitions. [2021-12-18 01:22:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 01:22:43,976 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 [2021-12-18 01:22:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:43,978 INFO L225 Difference]: With dead ends: 356 [2021-12-18 01:22:43,978 INFO L226 Difference]: Without dead ends: 307 [2021-12-18 01:22:43,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 151 SyntacticMatches, 17 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-18 01:22:43,979 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 240 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:43,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 1291 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 282 Invalid, 0 Unknown, 169 Unchecked, 0.3s Time] [2021-12-18 01:22:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-18 01:22:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 258. [2021-12-18 01:22:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 180 states have (on average 1.1888888888888889) internal successors, (214), 184 states have internal predecessors, (214), 61 states have call successors, (61), 14 states have call predecessors, (61), 16 states have return successors, (65), 59 states have call predecessors, (65), 59 states have call successors, (65) [2021-12-18 01:22:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 340 transitions. [2021-12-18 01:22:43,998 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 340 transitions. Word has length 79 [2021-12-18 01:22:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:43,998 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 340 transitions. [2021-12-18 01:22:43,999 INFO L471 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) [2021-12-18 01:22:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 340 transitions. [2021-12-18 01:22:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-18 01:22:44,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:44,003 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:44,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-18 01:22:44,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-18 01:22:44,219 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1762517655, now seen corresponding path program 1 times [2021-12-18 01:22:44,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:44,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495859687] [2021-12-18 01:22:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:44,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 01:22:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 01:22:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 01:22:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 01:22:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:22:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:22:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 01:22:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-18 01:22:44,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:44,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495859687] [2021-12-18 01:22:44,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495859687] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:44,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14856506] [2021-12-18 01:22:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:44,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:44,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:44,930 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) [2021-12-18 01:22:44,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 01:22:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:45,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 2566 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-18 01:22:45,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:45,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 01:22:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-18 01:22:46,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:22:46,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14856506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:46,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:22:46,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 27 [2021-12-18 01:22:46,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212625160] [2021-12-18 01:22:46,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:46,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 01:22:46,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:46,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 01:22:46,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2021-12-18 01:22:46,130 INFO L87 Difference]: Start difference. First operand 258 states and 340 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-18 01:22:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:46,263 INFO L93 Difference]: Finished difference Result 401 states and 528 transitions. [2021-12-18 01:22:46,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 01:22:46,264 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2021-12-18 01:22:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:46,266 INFO L225 Difference]: With dead ends: 401 [2021-12-18 01:22:46,266 INFO L226 Difference]: Without dead ends: 389 [2021-12-18 01:22:46,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2021-12-18 01:22:46,270 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 77 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:46,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 1133 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 95 Unchecked, 0.1s Time] [2021-12-18 01:22:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-12-18 01:22:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 307. [2021-12-18 01:22:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 219 states have (on average 1.187214611872146) internal successors, (260), 225 states have internal predecessors, (260), 67 states have call successors, (67), 17 states have call predecessors, (67), 20 states have return successors, (69), 64 states have call predecessors, (69), 65 states have call successors, (69) [2021-12-18 01:22:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 396 transitions. [2021-12-18 01:22:46,286 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 396 transitions. Word has length 86 [2021-12-18 01:22:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:46,286 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 396 transitions. [2021-12-18 01:22:46,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-18 01:22:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 396 transitions. [2021-12-18 01:22:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-18 01:22:46,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:46,289 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:46,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:46,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-18 01:22:46,511 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1504352217, now seen corresponding path program 1 times [2021-12-18 01:22:46,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:46,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365293852] [2021-12-18 01:22:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:46,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 01:22:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 01:22:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 01:22:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 01:22:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:22:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:22:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 01:22:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-18 01:22:46,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:46,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365293852] [2021-12-18 01:22:46,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365293852] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:46,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:22:46,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:22:46,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744856473] [2021-12-18 01:22:46,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:46,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:22:46,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:46,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:22:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:22:46,720 INFO L87 Difference]: Start difference. First operand 307 states and 396 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) [2021-12-18 01:22:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:46,948 INFO L93 Difference]: Finished difference Result 421 states and 541 transitions. [2021-12-18 01:22:46,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:22:46,949 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 [2021-12-18 01:22:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:46,951 INFO L225 Difference]: With dead ends: 421 [2021-12-18 01:22:46,951 INFO L226 Difference]: Without dead ends: 298 [2021-12-18 01:22:46,951 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:22:46,952 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:46,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 402 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 01:22:46,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-12-18 01:22:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2021-12-18 01:22:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 209 states have (on average 1.1818181818181819) internal successors, (247), 214 states have internal predecessors, (247), 67 states have call successors, (67), 17 states have call predecessors, (67), 19 states have return successors, (68), 64 states have call predecessors, (68), 65 states have call successors, (68) [2021-12-18 01:22:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 382 transitions. [2021-12-18 01:22:46,966 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 382 transitions. Word has length 86 [2021-12-18 01:22:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:46,967 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 382 transitions. [2021-12-18 01:22:46,967 INFO L471 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) [2021-12-18 01:22:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 382 transitions. [2021-12-18 01:22:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-18 01:22:46,968 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:46,969 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:46,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 01:22:46,969 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash 858492976, now seen corresponding path program 1 times [2021-12-18 01:22:46,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:46,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459958509] [2021-12-18 01:22:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:46,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 01:22:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 01:22:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 01:22:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 01:22:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:22:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:22:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 01:22:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-18 01:22:47,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:47,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459958509] [2021-12-18 01:22:47,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459958509] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:47,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:22:47,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 01:22:47,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10038859] [2021-12-18 01:22:47,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:47,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 01:22:47,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:47,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 01:22:47,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-18 01:22:47,295 INFO L87 Difference]: Start difference. First operand 296 states and 382 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) [2021-12-18 01:22:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:47,808 INFO L93 Difference]: Finished difference Result 317 states and 404 transitions. [2021-12-18 01:22:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 01:22:47,808 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 [2021-12-18 01:22:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:47,810 INFO L225 Difference]: With dead ends: 317 [2021-12-18 01:22:47,810 INFO L226 Difference]: Without dead ends: 298 [2021-12-18 01:22:47,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-12-18 01:22:47,812 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 82 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:47,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 1283 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 01:22:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-12-18 01:22:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 285. [2021-12-18 01:22:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 201 states have (on average 1.1691542288557213) internal successors, (235), 205 states have internal predecessors, (235), 64 states have call successors, (64), 17 states have call predecessors, (64), 19 states have return successors, (65), 62 states have call predecessors, (65), 62 states have call successors, (65) [2021-12-18 01:22:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 364 transitions. [2021-12-18 01:22:47,825 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 364 transitions. Word has length 88 [2021-12-18 01:22:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:47,826 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 364 transitions. [2021-12-18 01:22:47,826 INFO L471 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) [2021-12-18 01:22:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 364 transitions. [2021-12-18 01:22:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-18 01:22:47,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:47,828 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:47,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 01:22:47,828 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1641071482, now seen corresponding path program 1 times [2021-12-18 01:22:47,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:47,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228427605] [2021-12-18 01:22:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:47,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:47,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 01:22:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:22:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 01:22:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:22:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:22:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 01:22:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:22:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 01:22:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 01:22:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 01:22:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-18 01:22:48,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:48,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228427605] [2021-12-18 01:22:48,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228427605] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:48,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530128108] [2021-12-18 01:22:48,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:48,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:48,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:48,274 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) [2021-12-18 01:22:48,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-18 01:22:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:48,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-18 01:22:48,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-18 01:22:49,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:22:49,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530128108] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:49,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:22:49,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2021-12-18 01:22:49,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704724995] [2021-12-18 01:22:49,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:49,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 01:22:49,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:49,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 01:22:49,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-12-18 01:22:49,003 INFO L87 Difference]: Start difference. First operand 285 states and 364 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) [2021-12-18 01:22:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:49,162 INFO L93 Difference]: Finished difference Result 363 states and 459 transitions. [2021-12-18 01:22:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 01:22:49,163 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 [2021-12-18 01:22:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:49,164 INFO L225 Difference]: With dead ends: 363 [2021-12-18 01:22:49,164 INFO L226 Difference]: Without dead ends: 287 [2021-12-18 01:22:49,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-12-18 01:22:49,165 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 62 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:49,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 1716 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:22:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-18 01:22:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2021-12-18 01:22:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 201 states have (on average 1.154228855721393) internal successors, (232), 205 states have internal predecessors, (232), 64 states have call successors, (64), 17 states have call predecessors, (64), 19 states have return successors, (65), 62 states have call predecessors, (65), 62 states have call successors, (65) [2021-12-18 01:22:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 361 transitions. [2021-12-18 01:22:49,181 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 361 transitions. Word has length 99 [2021-12-18 01:22:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:49,181 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 361 transitions. [2021-12-18 01:22:49,181 INFO L471 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) [2021-12-18 01:22:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 361 transitions. [2021-12-18 01:22:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-18 01:22:49,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:49,183 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:49,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:49,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-18 01:22:49,396 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1774035915, now seen corresponding path program 1 times [2021-12-18 01:22:49,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:49,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045408723] [2021-12-18 01:22:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:49,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 01:22:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:22:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 01:22:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:22:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:22:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 01:22:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:22:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 01:22:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 01:22:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 01:22:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-18 01:22:49,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:49,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045408723] [2021-12-18 01:22:49,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045408723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:49,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:22:49,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 01:22:49,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29463701] [2021-12-18 01:22:49,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:49,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 01:22:49,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:49,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 01:22:49,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 01:22:49,636 INFO L87 Difference]: Start difference. First operand 285 states and 361 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-18 01:22:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:50,017 INFO L93 Difference]: Finished difference Result 428 states and 546 transitions. [2021-12-18 01:22:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:22:50,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 100 [2021-12-18 01:22:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:50,020 INFO L225 Difference]: With dead ends: 428 [2021-12-18 01:22:50,020 INFO L226 Difference]: Without dead ends: 313 [2021-12-18 01:22:50,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-18 01:22:50,021 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 128 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:50,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 640 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 01:22:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-18 01:22:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 275. [2021-12-18 01:22:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 193 states have (on average 1.1347150259067358) internal successors, (219), 198 states have internal predecessors, (219), 62 states have call successors, (62), 17 states have call predecessors, (62), 19 states have return successors, (63), 59 states have call predecessors, (63), 60 states have call successors, (63) [2021-12-18 01:22:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 344 transitions. [2021-12-18 01:22:50,038 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 344 transitions. Word has length 100 [2021-12-18 01:22:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:50,038 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 344 transitions. [2021-12-18 01:22:50,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-18 01:22:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 344 transitions. [2021-12-18 01:22:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-18 01:22:50,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:50,040 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:50,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-18 01:22:50,040 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1499276301, now seen corresponding path program 1 times [2021-12-18 01:22:50,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:50,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217440691] [2021-12-18 01:22:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:50,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 01:22:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:22:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 01:22:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:22:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:22:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 01:22:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:22:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 01:22:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 01:22:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 01:22:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-18 01:22:50,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:50,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217440691] [2021-12-18 01:22:50,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217440691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:50,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:22:50,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 01:22:50,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735223437] [2021-12-18 01:22:50,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:50,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 01:22:50,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:50,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 01:22:50,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-12-18 01:22:50,383 INFO L87 Difference]: Start difference. First operand 275 states and 344 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2021-12-18 01:22:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:51,050 INFO L93 Difference]: Finished difference Result 358 states and 445 transitions. [2021-12-18 01:22:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 01:22:51,051 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 100 [2021-12-18 01:22:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:51,052 INFO L225 Difference]: With dead ends: 358 [2021-12-18 01:22:51,052 INFO L226 Difference]: Without dead ends: 270 [2021-12-18 01:22:51,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-12-18 01:22:51,053 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 102 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:51,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 1286 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 01:22:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-12-18 01:22:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2021-12-18 01:22:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 186 states have (on average 1.1290322580645162) internal successors, (210), 191 states have internal predecessors, (210), 60 states have call successors, (60), 17 states have call predecessors, (60), 19 states have return successors, (61), 57 states have call predecessors, (61), 58 states have call successors, (61) [2021-12-18 01:22:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 331 transitions. [2021-12-18 01:22:51,068 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 331 transitions. Word has length 100 [2021-12-18 01:22:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:51,068 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 331 transitions. [2021-12-18 01:22:51,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2021-12-18 01:22:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 331 transitions. [2021-12-18 01:22:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-18 01:22:51,070 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:51,070 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:22:51,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 01:22:51,071 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash 831824902, now seen corresponding path program 1 times [2021-12-18 01:22:51,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:51,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583785567] [2021-12-18 01:22:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:51,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 01:22:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 01:22:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 01:22:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 01:22:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:22:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:22:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 01:22:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 01:22:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-18 01:22:51,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583785567] [2021-12-18 01:22:51,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583785567] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930554579] [2021-12-18 01:22:51,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:51,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:51,508 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) [2021-12-18 01:22:51,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-18 01:22:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:51,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 2582 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-18 01:22:51,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 01:22:52,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:22:53,055 INFO L388 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 29 treesize of output 17 [2021-12-18 01:22:53,151 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-18 01:22:53,151 INFO L388 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 31 treesize of output 26 [2021-12-18 01:22:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-18 01:22:53,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930554579] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:22:53,204 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:22:53,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 25 [2021-12-18 01:22:53,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588949862] [2021-12-18 01:22:53,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:22:53,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-18 01:22:53,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:53,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-18 01:22:53,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-12-18 01:22:53,205 INFO L87 Difference]: Start difference. First operand 266 states and 331 transitions. Second operand has 25 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 9 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2021-12-18 01:22:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:55,246 INFO L93 Difference]: Finished difference Result 438 states and 562 transitions. [2021-12-18 01:22:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-18 01:22:55,246 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 9 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) Word has length 96 [2021-12-18 01:22:55,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:55,248 INFO L225 Difference]: With dead ends: 438 [2021-12-18 01:22:55,248 INFO L226 Difference]: Without dead ends: 349 [2021-12-18 01:22:55,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 200 SyntacticMatches, 12 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=301, Invalid=2051, Unknown=0, NotChecked=0, Total=2352 [2021-12-18 01:22:55,250 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 337 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:55,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 1841 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1628 Invalid, 0 Unknown, 308 Unchecked, 1.3s Time] [2021-12-18 01:22:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-12-18 01:22:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 266. [2021-12-18 01:22:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 186 states have (on average 1.1236559139784945) internal successors, (209), 191 states have internal predecessors, (209), 60 states have call successors, (60), 17 states have call predecessors, (60), 19 states have return successors, (61), 57 states have call predecessors, (61), 58 states have call successors, (61) [2021-12-18 01:22:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 330 transitions. [2021-12-18 01:22:55,269 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 330 transitions. Word has length 96 [2021-12-18 01:22:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:55,269 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 330 transitions. [2021-12-18 01:22:55,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 9 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2021-12-18 01:22:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 330 transitions. [2021-12-18 01:22:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-18 01:22:55,271 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:55,271 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1] [2021-12-18 01:22:55,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:55,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-18 01:22:55,487 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:55,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1872049602, now seen corresponding path program 1 times [2021-12-18 01:22:55,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:55,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801882231] [2021-12-18 01:22:55,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:55,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 01:22:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 01:22:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 01:22:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 01:22:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:22:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:22:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-18 01:22:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-18 01:22:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 01:22:55,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:55,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801882231] [2021-12-18 01:22:55,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801882231] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:55,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380108699] [2021-12-18 01:22:55,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:55,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:55,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:55,772 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) [2021-12-18 01:22:55,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-18 01:22:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:56,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 2594 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-18 01:22:56,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-18 01:22:56,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:22:56,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380108699] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:56,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:22:56,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 13 [2021-12-18 01:22:56,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558677185] [2021-12-18 01:22:56,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:56,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 01:22:56,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:56,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 01:22:56,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:22:56,398 INFO L87 Difference]: Start difference. First operand 266 states and 330 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-18 01:22:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:56,528 INFO L93 Difference]: Finished difference Result 375 states and 466 transitions. [2021-12-18 01:22:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 01:22:56,529 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2021-12-18 01:22:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:56,531 INFO L225 Difference]: With dead ends: 375 [2021-12-18 01:22:56,531 INFO L226 Difference]: Without dead ends: 266 [2021-12-18 01:22:56,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-18 01:22:56,533 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 10 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:56,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1262 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:22:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-18 01:22:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-12-18 01:22:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 186 states have (on average 1.118279569892473) internal successors, (208), 191 states have internal predecessors, (208), 60 states have call successors, (60), 17 states have call predecessors, (60), 19 states have return successors, (59), 57 states have call predecessors, (59), 58 states have call successors, (59) [2021-12-18 01:22:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 327 transitions. [2021-12-18 01:22:56,549 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 327 transitions. Word has length 100 [2021-12-18 01:22:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:56,551 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 327 transitions. [2021-12-18 01:22:56,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-18 01:22:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2021-12-18 01:22:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-18 01:22:56,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:56,553 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:22:56,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:56,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:56,767 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:56,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash 238514967, now seen corresponding path program 2 times [2021-12-18 01:22:56,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:56,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978829986] [2021-12-18 01:22:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:56,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-18 01:22:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 01:22:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-18 01:22:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 01:22:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 01:22:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:22:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 01:22:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 01:22:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-18 01:22:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-18 01:22:57,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:57,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978829986] [2021-12-18 01:22:57,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978829986] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:22:57,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72492692] [2021-12-18 01:22:57,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 01:22:57,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:57,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:22:57,419 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) [2021-12-18 01:22:57,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-18 01:22:57,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 01:22:57,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 01:22:57,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-18 01:22:57,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:22:58,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 01:22:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-18 01:22:58,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:22:58,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72492692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:58,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:22:58,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 25 [2021-12-18 01:22:58,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269951720] [2021-12-18 01:22:58,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:58,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 01:22:58,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:58,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 01:22:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2021-12-18 01:22:58,703 INFO L87 Difference]: Start difference. First operand 266 states and 327 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-18 01:22:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:22:58,931 INFO L93 Difference]: Finished difference Result 347 states and 423 transitions. [2021-12-18 01:22:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 01:22:58,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2021-12-18 01:22:58,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:22:58,933 INFO L225 Difference]: With dead ends: 347 [2021-12-18 01:22:58,933 INFO L226 Difference]: Without dead ends: 304 [2021-12-18 01:22:58,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 101 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2021-12-18 01:22:58,934 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 73 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:22:58,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1573 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 148 Unchecked, 0.2s Time] [2021-12-18 01:22:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-12-18 01:22:58,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 209. [2021-12-18 01:22:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.0945945945945945) internal successors, (162), 153 states have internal predecessors, (162), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 37 states have call predecessors, (41), 40 states have call successors, (41) [2021-12-18 01:22:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2021-12-18 01:22:58,951 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 102 [2021-12-18 01:22:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:22:58,951 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2021-12-18 01:22:58,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-18 01:22:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2021-12-18 01:22:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-18 01:22:58,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:22:58,953 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:22:58,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-18 01:22:59,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:22:59,167 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:22:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:22:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2087155491, now seen corresponding path program 1 times [2021-12-18 01:22:59,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:22:59,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4925848] [2021-12-18 01:22:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:22:59,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:22:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:22:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 01:22:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:22:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 01:22:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:22:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:22:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:22:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:22:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 01:22:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:22:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 01:22:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 01:22:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 01:22:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 01:22:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:22:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-18 01:22:59,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:22:59,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4925848] [2021-12-18 01:22:59,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4925848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:22:59,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:22:59,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 01:22:59,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231954083] [2021-12-18 01:22:59,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:22:59,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 01:22:59,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:22:59,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 01:22:59,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-12-18 01:22:59,565 INFO L87 Difference]: Start difference. First operand 209 states and 244 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-18 01:23:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:23:00,253 INFO L93 Difference]: Finished difference Result 261 states and 306 transitions. [2021-12-18 01:23:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 01:23:00,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 109 [2021-12-18 01:23:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:23:00,255 INFO L225 Difference]: With dead ends: 261 [2021-12-18 01:23:00,255 INFO L226 Difference]: Without dead ends: 225 [2021-12-18 01:23:00,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2021-12-18 01:23:00,256 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 113 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 01:23:00,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 1179 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 01:23:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-18 01:23:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 209. [2021-12-18 01:23:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.087837837837838) internal successors, (161), 153 states have internal predecessors, (161), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 37 states have call predecessors, (41), 40 states have call successors, (41) [2021-12-18 01:23:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2021-12-18 01:23:00,270 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 109 [2021-12-18 01:23:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:23:00,271 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2021-12-18 01:23:00,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-18 01:23:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2021-12-18 01:23:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-18 01:23:00,291 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:23:00,292 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:23:00,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-18 01:23:00,292 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:23:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:23:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1526938213, now seen corresponding path program 1 times [2021-12-18 01:23:00,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:23:00,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918067577] [2021-12-18 01:23:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:23:00,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:23:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:23:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 01:23:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:23:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 01:23:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:23:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:23:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:23:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 01:23:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:23:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 01:23:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 01:23:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 01:23:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 01:23:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-18 01:23:00,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:23:00,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918067577] [2021-12-18 01:23:00,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918067577] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:23:00,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:23:00,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:23:00,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472250264] [2021-12-18 01:23:00,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:23:00,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:23:00,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:23:00,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:23:00,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:23:00,506 INFO L87 Difference]: Start difference. First operand 209 states and 243 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) [2021-12-18 01:23:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:23:00,735 INFO L93 Difference]: Finished difference Result 245 states and 283 transitions. [2021-12-18 01:23:00,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:23:00,735 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 [2021-12-18 01:23:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:23:00,736 INFO L225 Difference]: With dead ends: 245 [2021-12-18 01:23:00,736 INFO L226 Difference]: Without dead ends: 190 [2021-12-18 01:23:00,737 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:23:00,737 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 46 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:23:00,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 389 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 01:23:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-18 01:23:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-12-18 01:23:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 135 states have (on average 1.0814814814814815) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (35), 32 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-18 01:23:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2021-12-18 01:23:00,752 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 109 [2021-12-18 01:23:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:23:00,752 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2021-12-18 01:23:00,753 INFO L471 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) [2021-12-18 01:23:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2021-12-18 01:23:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-12-18 01:23:00,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:23:00,755 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:23:00,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-18 01:23:00,755 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:23:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:23:00,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1932416507, now seen corresponding path program 1 times [2021-12-18 01:23:00,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:23:00,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295536449] [2021-12-18 01:23:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:23:00,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:23:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:23:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 01:23:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:23:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:00,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 01:23:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:23:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:23:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:23:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 01:23:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:23:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 01:23:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 01:23:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 01:23:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 01:23:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:23:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-18 01:23:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-12-18 01:23:01,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:23:01,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295536449] [2021-12-18 01:23:01,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295536449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:23:01,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:23:01,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 01:23:01,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760554306] [2021-12-18 01:23:01,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:23:01,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 01:23:01,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:23:01,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 01:23:01,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-18 01:23:01,104 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2021-12-18 01:23:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:23:01,614 INFO L93 Difference]: Finished difference Result 249 states and 288 transitions. [2021-12-18 01:23:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 01:23:01,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) Word has length 125 [2021-12-18 01:23:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:23:01,618 INFO L225 Difference]: With dead ends: 249 [2021-12-18 01:23:01,618 INFO L226 Difference]: Without dead ends: 189 [2021-12-18 01:23:01,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-12-18 01:23:01,620 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 85 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 01:23:01,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 942 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 01:23:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-18 01:23:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-18 01:23:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 135 states have (on average 1.0666666666666667) internal successors, (144), 138 states have internal predecessors, (144), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 32 states have call predecessors, (34), 33 states have call successors, (34) [2021-12-18 01:23:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 212 transitions. [2021-12-18 01:23:01,645 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 212 transitions. Word has length 125 [2021-12-18 01:23:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:23:01,645 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 212 transitions. [2021-12-18 01:23:01,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 5 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2021-12-18 01:23:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 212 transitions. [2021-12-18 01:23:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-18 01:23:01,647 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:23:01,647 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:23:01,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-18 01:23:01,647 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:23:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:23:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2132558451, now seen corresponding path program 1 times [2021-12-18 01:23:01,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:23:01,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374929255] [2021-12-18 01:23:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:23:01,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:23:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:23:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 01:23:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:23:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 01:23:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:23:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:23:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:23:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 01:23:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:23:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 01:23:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 01:23:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 01:23:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 01:23:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 01:23:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:23:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 01:23:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-12-18 01:23:01,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:23:01,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374929255] [2021-12-18 01:23:01,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374929255] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:23:01,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:23:01,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 01:23:01,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001020903] [2021-12-18 01:23:01,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:23:01,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 01:23:01,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:23:01,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 01:23:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 01:23:01,903 INFO L87 Difference]: Start difference. First operand 189 states and 212 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) [2021-12-18 01:23:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:23:02,165 INFO L93 Difference]: Finished difference Result 228 states and 255 transitions. [2021-12-18 01:23:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:23:02,165 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 [2021-12-18 01:23:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:23:02,166 INFO L225 Difference]: With dead ends: 228 [2021-12-18 01:23:02,166 INFO L226 Difference]: Without dead ends: 189 [2021-12-18 01:23:02,167 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:23:02,167 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 93 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:23:02,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 514 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 01:23:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-18 01:23:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-18 01:23:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 135 states have (on average 1.0592592592592593) internal successors, (143), 138 states have internal predecessors, (143), 34 states have call successors, (34), 18 states have call predecessors, (34), 19 states have return successors, (34), 32 states have call predecessors, (34), 33 states have call successors, (34) [2021-12-18 01:23:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2021-12-18 01:23:02,183 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 134 [2021-12-18 01:23:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:23:02,183 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2021-12-18 01:23:02,184 INFO L471 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) [2021-12-18 01:23:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2021-12-18 01:23:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-18 01:23:02,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:23:02,185 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:23:02,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-18 01:23:02,185 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:23:02,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:23:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash 284756267, now seen corresponding path program 1 times [2021-12-18 01:23:02,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:23:02,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912822988] [2021-12-18 01:23:02,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:23:02,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:23:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:23:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 01:23:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:23:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 01:23:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 01:23:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 01:23:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:23:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 01:23:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 01:23:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 01:23:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 01:23:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-18 01:23:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 01:23:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 01:23:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 01:23:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 01:23:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 01:23:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-12-18 01:23:02,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:23:02,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912822988] [2021-12-18 01:23:02,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912822988] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:23:02,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309978035] [2021-12-18 01:23:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:23:02,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:23:02,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:23:02,620 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 01:23:02,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-18 01:23:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:23:03,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 2752 conjuncts, 99 conjunts are in the unsatisfiable core [2021-12-18 01:23:03,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:23:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-18 01:23:05,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:23:07,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309978035] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:23:07,748 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:23:07,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 44 [2021-12-18 01:23:07,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911950580] [2021-12-18 01:23:07,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:23:07,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-18 01:23:07,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:23:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-18 01:23:07,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2021-12-18 01:23:07,751 INFO L87 Difference]: Start difference. First operand 189 states and 211 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) [2021-12-18 01:23:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:23:08,552 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2021-12-18 01:23:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 01:23:08,553 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 [2021-12-18 01:23:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:23:08,553 INFO L225 Difference]: With dead ends: 204 [2021-12-18 01:23:08,553 INFO L226 Difference]: Without dead ends: 0 [2021-12-18 01:23:08,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 140 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=287, Invalid=4405, Unknown=0, NotChecked=0, Total=4692 [2021-12-18 01:23:08,555 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 01:23:08,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 547 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 577 Invalid, 0 Unknown, 54 Unchecked, 0.4s Time] [2021-12-18 01:23:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-18 01:23:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-18 01:23:08,556 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) [2021-12-18 01:23:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-18 01:23:08,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2021-12-18 01:23:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:23:08,556 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-18 01:23:08,557 INFO L471 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) [2021-12-18 01:23:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-18 01:23:08,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-18 01:23:08,559 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 01:23:08,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-18 01:23:08,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-18 01:23:08,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-18 01:23:13,901 INFO L854 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (and (not (= 16 |ensure_string_is_allocated_bounded_length_#in~max_size#1|)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (not (= 0 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base|)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= 0 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base|)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0)) (not (< 0 |#StackHeapBarrier|))) [2021-12-18 01:23:13,902 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2021-12-18 01:23:13,902 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (not (= 16 |ensure_string_is_allocated_bounded_length_#in~max_size#1|)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (not (= 0 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base|)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0))) [2021-12-18 01:23:13,902 INFO L858 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2021-12-18 01:23:13,902 INFO L854 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (let ((.cse0 (not (= 16 |ensure_string_is_allocated_bounded_length_#in~max_size#1|)))) (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (or (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15)) .cse0) (= |#memory_real| |old(#memory_real)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or .cse0 (<= (* 18446744073709551616 (div (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551600) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2021-12-18 01:23:13,902 INFO L858 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2021-12-18 01:23:13,903 INFO L854 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (not (= 16 |ensure_string_is_allocated_bounded_length_#in~max_size#1|)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (not (= 0 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base|)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0))) [2021-12-18 01:23:13,903 INFO L858 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2021-12-18 01:23:13,903 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2021-12-18 01:23:13,903 INFO L854 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2021-12-18 01:23:13,907 INFO L858 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2021-12-18 01:23:13,907 INFO L858 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2021-12-18 01:23:13,907 INFO L854 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2021-12-18 01:23:13,907 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2021-12-18 01:23:13,908 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2021-12-18 01:23:13,908 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-18 01:23:13,908 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-18 01:23:13,908 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-18 01:23:13,908 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-18 01:23:13,908 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |bounded_malloc_#in~size| bounded_malloc_~size))) [2021-12-18 01:23:13,908 INFO L861 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2021-12-18 01:23:13,908 INFO L858 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2021-12-18 01:23:13,909 INFO L858 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2021-12-18 01:23:13,909 INFO L861 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2021-12-18 01:23:13,909 INFO L858 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2021-12-18 01:23:13,909 INFO L858 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2021-12-18 01:23:13,909 INFO L861 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2021-12-18 01:23:13,909 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-18 01:23:13,909 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-18 01:23:13,910 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-18 01:23:13,910 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-18 01:23:13,910 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-18 01:23:13,910 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-18 01:23:13,910 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-18 01:23:13,910 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2021-12-18 01:23:13,910 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2021-12-18 01:23:13,911 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2021-12-18 01:23:13,911 INFO L861 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2021-12-18 01:23:13,911 INFO L858 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2021-12-18 01:23:13,911 INFO L858 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2021-12-18 01:23:13,911 INFO L858 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2021-12-18 01:23:13,911 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2021-12-18 01:23:13,911 INFO L858 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2021-12-18 01:23:13,911 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2021-12-18 01:23:13,912 INFO L861 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7368 7372) the Hoare annotation is: true [2021-12-18 01:23:13,912 INFO L858 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2021-12-18 01:23:13,913 INFO L858 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2021-12-18 01:23:13,913 INFO L858 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2021-12-18 01:23:13,913 INFO L858 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2021-12-18 01:23:13,913 INFO L858 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2021-12-18 01:23:13,913 INFO L858 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2021-12-18 01:23:13,913 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2021-12-18 01:23:13,913 INFO L858 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2021-12-18 01:23:13,913 INFO L858 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2021-12-18 01:23:13,914 INFO L858 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2021-12-18 01:23:13,914 INFO L858 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2021-12-18 01:23:13,914 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2021-12-18 01:23:13,914 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-18 01:23:13,914 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-18 01:23:13,914 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-18 01:23:13,914 INFO L858 garLoopResultBuilder]: For program point L6675-1(line 6675) no Hoare annotation was computed. [2021-12-18 01:23:13,915 INFO L854 garLoopResultBuilder]: At program point L6675(line 6675) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (= 0 |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#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|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_#t~mem502#1|)) [2021-12-18 01:23:13,915 INFO L858 garLoopResultBuilder]: For program point L9549(lines 9549 9550) no Hoare annotation was computed. [2021-12-18 01:23:13,915 INFO L858 garLoopResultBuilder]: For program point L9549-2(lines 9549 9550) no Hoare annotation was computed. [2021-12-18 01:23:13,915 INFO L858 garLoopResultBuilder]: For program point L9549-3(lines 9549 9559) no Hoare annotation was computed. [2021-12-18 01:23:13,915 INFO L854 garLoopResultBuilder]: At program point L9549-4(lines 9549 9559) the Hoare annotation is: (let ((.cse0 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse1 (< 0 |#StackHeapBarrier|))) (or (and (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse0 .cse1 (not (= 0 (select (select |#memory_$Pointer$.base| |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))))) (and (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|))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616)))) .cse0 .cse1))) [2021-12-18 01:23:13,915 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-18 01:23:13,915 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-18 01:23:13,916 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2021-12-18 01:23:13,916 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-18 01:23:13,916 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-18 01:23:13,916 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2021-12-18 01:23:13,917 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-18 01:23:13,918 INFO L854 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1359#1| 1) (<= 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1359#1|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (< 0 |#StackHeapBarrier|)) [2021-12-18 01:23:13,919 INFO L858 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2021-12-18 01:23:13,919 INFO L854 garLoopResultBuilder]: At program point L9329-4(line 9329) the Hoare annotation is: (let ((.cse15 (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 ((.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse14 (* .cse15 (- 1)))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse8 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset|)) (.cse11 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse2 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse12 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse7 (<= 0 (+ .cse15 (* 18446744073709551616 (div .cse14 18446744073709551616))))) (.cse16 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0)) (.cse9 (not (= (select .cse19 8) 0))) (.cse1 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse17 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base|)) (.cse18 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset|)) (.cse4 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (< 0 |#StackHeapBarrier|)) (.cse6 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1|) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse13 (not .cse0) (<= 1 (+ (* 18446744073709551616 (div (+ .cse14 18446744073709551615) 18446744073709551616)) .cse15)) .cse16) (and .cse8 (<= .cse15 (* 18446744073709551616 (div .cse15 18446744073709551616))) .cse17 .cse11 .cse18 .cse4 .cse13 .cse5 .cse16) (and .cse8 .cse17 .cse11 .cse2 .cse3 .cse4 .cse13 .cse5 (not (= 0 (select .cse19 (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)))) .cse16 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1|) (and .cse8 .cse11 (= 0 |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) .cse2 .cse12 (= |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 .cse18 .cse5 .cse13 .cse7 .cse16) (and .cse9 .cse1 .cse10 .cse17 (<= 1 (let ((.cse20 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|) 0))) (+ .cse20 (* 18446744073709551616 (div (+ (* .cse20 (- 1)) 18446744073709551615) 18446744073709551616))))) .cse18 .cse4 .cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0) (let ((.cse21 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset|))) (<= .cse21 (+ (* 18446744073709551616 (div (+ .cse21 (- 1)) 18446744073709551616)) 18446744073709551615))) |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1| .cse6))))) [2021-12-18 01:23:13,919 INFO L858 garLoopResultBuilder]: For program point L9329-5(line 9329) no Hoare annotation was computed. [2021-12-18 01:23:13,920 INFO L858 garLoopResultBuilder]: For program point L9329(line 9329) no Hoare annotation was computed. [2021-12-18 01:23:13,920 INFO L854 garLoopResultBuilder]: At program point L9552(line 9552) the Hoare annotation is: false [2021-12-18 01:23:13,920 INFO L854 garLoopResultBuilder]: At program point L9329-2(line 9329) 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|)) (.cse2 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse3 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|))) (let ((.cse0 (or (and (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset|) .cse2 .cse11 .cse3) (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1|))) (.cse1 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (.cse4 (not .cse11)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|)) (.cse9 (* .cse8 (- 1))) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0))) (or (and (= 0 |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset|) .cse6 .cse7 (<= 0 (+ .cse8 (* 18446744073709551616 (div .cse9 18446744073709551616)))) .cse10) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) .cse0 .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse3 .cse4 .cse5 .cse7 .cse6 (<= 1 (+ (* 18446744073709551616 (div (+ .cse9 18446744073709551615) 18446744073709551616)) .cse8)) .cse10)))) [2021-12-18 01:23:13,920 INFO L854 garLoopResultBuilder]: At program point L9552-1(line 9552) the Hoare annotation is: false [2021-12-18 01:23:13,920 INFO L858 garLoopResultBuilder]: For program point L9329-3(line 9329) no Hoare annotation was computed. [2021-12-18 01:23:13,921 INFO L858 garLoopResultBuilder]: For program point L9552-2(line 9552) no Hoare annotation was computed. [2021-12-18 01:23:13,921 INFO L854 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (< 0 |#StackHeapBarrier|)) (.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|))) (or (and .cse0 (= 0 |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) .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 .cse3 (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) .cse4))) .cse5) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) .cse4) 0) .cse0 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2 .cse3 .cse5))) [2021-12-18 01:23:13,921 INFO L854 garLoopResultBuilder]: At program point L9544-1(line 9544) the Hoare annotation is: (let ((.cse0 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse1 (< 0 |#StackHeapBarrier|))) (or (and (<= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1349#1|) (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1349#1| 0) .cse0 .cse1) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) .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|))) (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))))) (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.offset| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset|) .cse0 .cse1 (not (= 0 (select (select |#memory_$Pointer$.base| |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))))))) [2021-12-18 01:23:13,921 INFO L858 garLoopResultBuilder]: For program point L9544-2(line 9544) no Hoare annotation was computed. [2021-12-18 01:23:13,921 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-18 01:23:13,921 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2021-12-18 01:23:13,921 INFO L858 garLoopResultBuilder]: For program point L9330(line 9330) no Hoare annotation was computed. [2021-12-18 01:23:13,922 INFO L858 garLoopResultBuilder]: For program point L9330-5(line 9330) no Hoare annotation was computed. [2021-12-18 01:23:13,922 INFO L858 garLoopResultBuilder]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2021-12-18 01:23:13,922 INFO L854 garLoopResultBuilder]: At program point L9330-2(line 9330) the Hoare annotation is: (let ((.cse0 (< 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse1 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse2 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base|)) (.cse3 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset|)) (.cse4 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (< 0 |#StackHeapBarrier|)) (.cse6 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|))) (or (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse3 .cse4 .cse5 .cse6 (<= 0 (let ((.cse7 (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|))) (+ .cse7 (* 18446744073709551616 (div (* .cse7 (- 1)) 18446744073709551616)))))) (and .cse0 (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1|) (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_harness_~#cursor~2#1.offset| 0) .cse2 (<= 1 (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|) 0))) (+ .cse8 (* 18446744073709551616 (div (+ (* .cse8 (- 1)) 18446744073709551615) 18446744073709551616))))) .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0) .cse6))) [2021-12-18 01:23:13,922 INFO L858 garLoopResultBuilder]: For program point L9330-3(line 9330) no Hoare annotation was computed. [2021-12-18 01:23:13,922 INFO L854 garLoopResultBuilder]: At program point L9330-4(line 9330) the Hoare annotation is: (let ((.cse23 (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 ((.cse22 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse24 (* .cse23 (- 1)))) (let ((.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse13 (<= 0 (+ .cse23 (* 18446744073709551616 (div .cse24 18446744073709551616))))) (.cse0 (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1|)) (.cse3 (<= |ULTIMATE.start_aws_string_eq_byte_cursor_#t~ret1291#1| 0)) (.cse9 (<= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~ret1291#1|)) (.cse11 (< 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse1 (let ((.cse25 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset|))) (<= .cse25 (+ (* 18446744073709551616 (div (+ .cse25 (- 1)) 18446744073709551616)) 18446744073709551615)))) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse10 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse4 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse12 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base|)) (.cse17 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset|)) (.cse15 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset|)) (.cse20 (not (= (select .cse22 8) 0))) (.cse21 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse16 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse5 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse7 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse18 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse8 (< 0 |#StackHeapBarrier|)) (.cse19 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse10 .cse13) (and .cse4 (= 0 |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) .cse14 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse15 .cse16 .cse5 .cse7 .cse17 .cse18 .cse8 .cse13 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) .cse5 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse20 .cse2 .cse21 .cse12 .cse6 .cse7 .cse8 .cse10) (and .cse15 .cse12 .cse16 .cse4 .cse6 .cse7 .cse18 .cse8 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| (not (= 0 (select .cse22 (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)))) .cse19) (and .cse15 (<= .cse23 (* 18446744073709551616 (div .cse23 18446744073709551616))) .cse12 .cse16 .cse17 .cse7 .cse8 .cse18 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse19) (and .cse15 .cse20 .cse21 .cse16 .cse5 .cse6 .cse7 .cse18 .cse8 (<= 1 (+ (* 18446744073709551616 (div (+ .cse24 18446744073709551615) 18446744073709551616)) .cse23)) |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse19))))) [2021-12-18 01:23:13,922 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-18 01:23:13,923 INFO L861 garLoopResultBuilder]: At program point L9562(line 9562) the Hoare annotation is: true [2021-12-18 01:23:13,923 INFO L858 garLoopResultBuilder]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2021-12-18 01:23:13,923 INFO L858 garLoopResultBuilder]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2021-12-18 01:23:13,923 INFO L854 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2021-12-18 01:23:13,923 INFO L858 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2021-12-18 01:23:13,923 INFO L858 garLoopResultBuilder]: For program point L9554-1(line 9554) no Hoare annotation was computed. [2021-12-18 01:23:13,923 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2021-12-18 01:23:13,924 INFO L854 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2021-12-18 01:23:13,924 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-18 01:23:13,924 INFO L858 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2021-12-18 01:23:13,924 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-18 01:23:13,924 INFO L858 garLoopResultBuilder]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2021-12-18 01:23:13,924 INFO L858 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2021-12-18 01:23:13,924 INFO L854 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2021-12-18 01:23:13,924 INFO L858 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2021-12-18 01:23:13,925 INFO L858 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2021-12-18 01:23:13,925 INFO L858 garLoopResultBuilder]: For program point L6673-3(lines 6673 6675) no Hoare annotation was computed. [2021-12-18 01:23:13,925 INFO L858 garLoopResultBuilder]: For program point L6673-1(lines 6673 6675) no Hoare annotation was computed. [2021-12-18 01:23:13,925 INFO L854 garLoopResultBuilder]: At program point L6673(line 6673) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (= 0 |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#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|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) [2021-12-18 01:23:13,925 INFO L854 garLoopResultBuilder]: At program point L9349(line 9349) the Hoare annotation is: (let ((.cse0 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse1 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base|)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (< 0 |#StackHeapBarrier|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|))) (or (and .cse0 .cse1 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse2 .cse3 .cse4 .cse5 (<= 0 (let ((.cse6 (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|))) (+ .cse6 (* 18446744073709551616 (div (* .cse6 (- 1)) 18446744073709551616)))))) (and (let ((.cse7 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset|))) (<= .cse7 (+ (* 18446744073709551616 (div (+ .cse7 (- 1)) 18446744073709551616)) 18446744073709551615))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-12-18 01:23:13,925 INFO L858 garLoopResultBuilder]: For program point L9349-1(line 9349) no Hoare annotation was computed. [2021-12-18 01:23:13,926 INFO L854 garLoopResultBuilder]: At program point L9349-2(lines 9327 9350) the Hoare annotation is: (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|)) (.cse1 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base|)) (.cse9 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (< 0 |#StackHeapBarrier|)) (.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|))) (or (and (<= .cse0 (* 18446744073709551616 (div .cse0 18446744073709551616))) .cse1 .cse2 (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset|) .cse3) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res#1| 0) (let ((.cse5 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse7 (* .cse0 (- 1)))) (or (and (or (and (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset|))) (<= .cse4 (+ (* 18446744073709551616 (div (+ .cse4 (- 1)) 18446744073709551616)) 18446744073709551615))) .cse5 .cse6 .cse2 .cse3) (and .cse5 .cse6 .cse2 .cse3 (<= 1 (+ (* 18446744073709551616 (div (+ .cse7 18446744073709551615) 18446744073709551616)) .cse0)))) (not (= (select .cse8 8) 0)) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset|) .cse9 .cse5 .cse6 (= |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 .cse3 (<= 0 (+ .cse0 (* 18446744073709551616 (div .cse7 18446744073709551616)))))))) (and .cse1 .cse9 .cse6 .cse2 .cse3 (not (= 0 (select .cse8 (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8))))))) [2021-12-18 01:23:13,926 INFO L854 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse0 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse1 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) .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|))) (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))))) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base|) (= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset|) .cse0 .cse1 (not (= 0 (select (select |#memory_$Pointer$.base| |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))))))) [2021-12-18 01:23:13,926 INFO L858 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2021-12-18 01:23:13,926 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-18 01:23:13,926 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-18 01:23:13,926 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-18 01:23:13,926 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-18 01:23:13,927 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-18 01:23:13,927 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-18 01:23:13,930 INFO L732 BasicCegarLoop]: Path program histogram: [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] [2021-12-18 01:23:13,931 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 01:23:13,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 01:23:13,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 01:23:13,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 01:23:13,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 01:23:13,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:23:13 BoogieIcfgContainer [2021-12-18 01:23:13,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 01:23:13,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 01:23:13,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 01:23:13,973 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 01:23:13,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:22:25" (3/4) ... [2021-12-18 01:23:13,977 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-18 01:23:13,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2021-12-18 01:23:13,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-18 01:23:13,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2021-12-18 01:23:13,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2021-12-18 01:23:13,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-18 01:23:13,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-18 01:23:13,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-18 01:23:13,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-18 01:23:13,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-18 01:23:13,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2021-12-18 01:23:14,000 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2021-12-18 01:23:14,001 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-12-18 01:23:14,003 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-12-18 01:23:14,004 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-18 01:23:14,005 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-12-18 01:23:14,006 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-18 01:23:14,007 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-18 01:23:14,008 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-18 01:23:14,038 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) && 0 == str) && 1 < cursor) && 0 == str) && 0 < unknown-#StackHeapBarrier-unknown) || (\result == 0 && ((((((((unknown-#memory_int-unknown[cur][cur] <= 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] + -1) / 18446744073709551616) + 18446744073709551615 && !(str == 0)) && str == 0) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) || ((((!(str == 0) && str == 0) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) && 1 <= 18446744073709551616 * ((unknown-#memory_int-unknown[cursor][cursor] * -1 + 18446744073709551615) / 18446744073709551616) + unknown-#memory_int-unknown[cursor][cursor])) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == 0) || (((((((cursor == cursor && 0 == cursor) && !(str == 0)) && str == 0) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= unknown-#memory_int-unknown[cursor][cursor] + 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] * -1 / 18446744073709551616))))) || (((((0 == str && 0 == cursor) && str == 0) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) && !(0 == #memory_$Pointer$[cursor][cursor + 8])) [2021-12-18 01:23:14,039 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(16 == \old(max_size)) && (\old(max_size) == max_size || max_size == 16)) && !(0 == str)) && str == 0) && !(0 == \result)) && \result == 0) || !(0 < unknown-#StackHeapBarrier-unknown) [2021-12-18 01:23:14,656 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 01:23:14,656 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 01:23:14,657 INFO L158 Benchmark]: Toolchain (without parser) took 52938.48ms. Allocated memory was 92.3MB in the beginning and 564.1MB in the end (delta: 471.9MB). Free memory was 51.5MB in the beginning and 392.3MB in the end (delta: -340.9MB). Peak memory consumption was 379.4MB. Max. memory is 16.1GB. [2021-12-18 01:23:14,657 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 01:23:14,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2520.93ms. Allocated memory was 92.3MB in the beginning and 140.5MB in the end (delta: 48.2MB). Free memory was 51.5MB in the beginning and 68.5MB in the end (delta: -17.0MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2021-12-18 01:23:14,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 193.40ms. Allocated memory is still 140.5MB. Free memory was 68.5MB in the beginning and 56.6MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-18 01:23:14,658 INFO L158 Benchmark]: Boogie Preprocessor took 129.14ms. Allocated memory is still 140.5MB. Free memory was 56.6MB in the beginning and 83.8MB in the end (delta: -27.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 01:23:14,658 INFO L158 Benchmark]: RCFGBuilder took 1046.73ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 83.8MB in the beginning and 73.6MB in the end (delta: 10.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2021-12-18 01:23:14,658 INFO L158 Benchmark]: TraceAbstraction took 48356.94ms. Allocated memory was 186.6MB in the beginning and 564.1MB in the end (delta: 377.5MB). Free memory was 72.6MB in the beginning and 217.2MB in the end (delta: -144.7MB). Peak memory consumption was 299.9MB. Max. memory is 16.1GB. [2021-12-18 01:23:14,659 INFO L158 Benchmark]: Witness Printer took 683.41ms. Allocated memory is still 564.1MB. Free memory was 217.2MB in the beginning and 392.3MB in the end (delta: -175.1MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2021-12-18 01:23:14,659 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.17ms. Allocated memory is still 92.3MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2520.93ms. Allocated memory was 92.3MB in the beginning and 140.5MB in the end (delta: 48.2MB). Free memory was 51.5MB in the beginning and 68.5MB in the end (delta: -17.0MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 193.40ms. Allocated memory is still 140.5MB. Free memory was 68.5MB in the beginning and 56.6MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.14ms. Allocated memory is still 140.5MB. Free memory was 56.6MB in the beginning and 83.8MB in the end (delta: -27.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1046.73ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 83.8MB in the beginning and 73.6MB in the end (delta: 10.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 48356.94ms. Allocated memory was 186.6MB in the beginning and 564.1MB in the end (delta: 377.5MB). Free memory was 72.6MB in the beginning and 217.2MB in the end (delta: -144.7MB). Peak memory consumption was 299.9MB. Max. memory is 16.1GB. * Witness Printer took 683.41ms. Allocated memory is still 564.1MB. Free memory was 217.2MB in the beginning and 392.3MB in the end (delta: -175.1MB). Peak memory consumption was 72.4MB. 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: 48.3s, OverallIterations: 28, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2957 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2740 mSDsluCounter, 26363 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1006 IncrementalHoareTripleChecker+Unchecked, 21946 mSDsCounter, 958 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8077 IncrementalHoareTripleChecker+Invalid, 10041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 958 mSolverCounterUnsat, 4417 mSDtfsCounter, 8077 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2765 GetRequests, 2212 SyntacticMatches, 83 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2872 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=15, InterpolantAutomatonStates: 293, 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, 28 MinimizatonAttempts, 605 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 569 PreInvPairs, 634 NumberOfFragments, 1881 HoareAnnotationTreeSize, 569 FomulaSimplifications, 3196 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 42 FomulaSimplificationsInter, 346175 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 6.4s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 3783 NumberOfCodeBlocks, 3783 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 4176 ConstructedInterpolants, 215 QuantifiedInterpolants, 20475 SizeOfPredicates, 153 NumberOfNonLiveVariables, 40841 ConjunctsInSsa, 415 ConjunctsInUnsatCore, 50 InterpolantComputations, 22 PerfectInterpolantSequences, 2083/2342 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 [2021-12-18 01:23:14,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 01:23:14,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 01:23:14,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 01:23:14,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) && 0 == str) && 1 < cursor) && 0 == str) && 0 < unknown-#StackHeapBarrier-unknown) || (\result == 0 && ((((((((unknown-#memory_int-unknown[cur][cur] <= 18446744073709551616 * ((unknown-#memory_int-unknown[cur][cur] + -1) / 18446744073709551616) + 18446744073709551615 && !(str == 0)) && str == 0) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) || ((((!(str == 0) && str == 0) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) && 1 <= 18446744073709551616 * ((unknown-#memory_int-unknown[cursor][cursor] * -1 + 18446744073709551615) / 18446744073709551616) + unknown-#memory_int-unknown[cursor][cursor])) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == 0) || (((((((cursor == cursor && 0 == cursor) && !(str == 0)) && str == 0) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= unknown-#memory_int-unknown[cursor][cursor] + 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] * -1 / 18446744073709551616))))) || (((((0 == str && 0 == cursor) && str == 0) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) && !(0 == #memory_$Pointer$[cursor][cursor + 8])) - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: (((((!(16 == \old(max_size)) && (\old(max_size) == max_size || max_size == 16)) && !(0 == str)) && str == 0) && !(0 == \result)) && \result == 0) || !(0 < unknown-#StackHeapBarrier-unknown) RESULT: Ultimate proved your program to be correct! [2021-12-18 01:23:14,721 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