./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_clean_up_harness.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_clean_up_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 --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 c2c8100e1f648cee1922c84a2421989bafb670d4445ddc160c17e3cd878eaa49 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 06:48:51,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 06:48:51,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 06:48:51,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 06:48:51,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 06:48:51,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 06:48:51,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 06:48:51,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 06:48:51,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 06:48:51,330 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 06:48:51,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 06:48:51,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 06:48:51,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 06:48:51,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 06:48:51,332 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 06:48:51,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 06:48:51,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 06:48:51,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 06:48:51,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 06:48:51,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 06:48:51,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 06:48:51,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 06:48:51,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 06:48:51,334 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 06:48:51,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 06:48:51,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 06:48:51,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 06:48:51,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 06:48:51,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 06:48:51,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 06:48:51,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 06:48:51,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 06:48:51,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 06:48:51,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 06:48:51,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 06:48:51,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 06:48:51,338 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 06:48:51,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 06:48:51,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 06:48:51,338 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> c2c8100e1f648cee1922c84a2421989bafb670d4445ddc160c17e3cd878eaa49 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 06:48:51,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 06:48:51,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 06:48:51,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 06:48:51,568 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 06:48:51,569 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 06:48:51,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_clean_up_harness.i [2023-11-23 06:48:52,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 06:48:53,072 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 06:48:53,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_clean_up_harness.i [2023-11-23 06:48:53,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e53c94c6e/ee3b580e1b7a494cae6a1618848a9ba6/FLAG71f0fad94 [2023-11-23 06:48:53,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e53c94c6e/ee3b580e1b7a494cae6a1618848a9ba6 [2023-11-23 06:48:53,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 06:48:53,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 06:48:53,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 06:48:53,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 06:48:53,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 06:48:53,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:48:53" (1/1) ... [2023-11-23 06:48:53,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc3dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:53, skipping insertion in model container [2023-11-23 06:48:53,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:48:53" (1/1) ... [2023-11-23 06:48:53,230 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 06:48:53,436 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_clean_up_harness.i[4495,4508] [2023-11-23 06:48:53,442 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_clean_up_harness.i[4555,4568] [2023-11-23 06:48:53,933 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:53,933 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:53,934 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:53,934 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:53,935 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:53,943 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:53,944 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:53,945 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:53,946 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,222 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 06:48:54,223 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 06:48:54,224 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 06:48:54,226 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 06:48:54,229 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 06:48:54,230 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 06:48:54,231 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 06:48:54,234 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 06:48:54,235 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 06:48:54,237 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 06:48:54,426 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,426 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 06:48:54,509 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 06:48:54,525 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_clean_up_harness.i[4495,4508] [2023-11-23 06:48:54,526 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_clean_up_harness.i[4555,4568] [2023-11-23 06:48:54,559 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,559 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,562 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,563 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,563 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,571 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,571 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,572 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,572 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,617 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 06:48:54,618 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 06:48:54,619 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 06:48:54,619 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 06:48:54,620 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 06:48:54,620 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 06:48:54,621 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 06:48:54,621 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 06:48:54,622 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 06:48:54,622 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 06:48:54,702 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8073] [2023-11-23 06:48:54,703 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,703 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:48:54,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8559-8570] [2023-11-23 06:48:54,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 06:48:54,991 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,991 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,991 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,991 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,992 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,992 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,992 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,992 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,992 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,992 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,992 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,993 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,993 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,993 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,993 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,993 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,993 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,993 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:48:54,999 INFO L206 MainTranslator]: Completed translation [2023-11-23 06:48:55,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54 WrapperNode [2023-11-23 06:48:55,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 06:48:55,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 06:48:55,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 06:48:55,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 06:48:55,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,156 INFO L138 Inliner]: procedures = 690, calls = 2505, calls flagged for inlining = 53, calls inlined = 4, statements flattened = 751 [2023-11-23 06:48:55,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 06:48:55,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 06:48:55,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 06:48:55,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 06:48:55,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,232 INFO L188 MemorySlicer]: Split 526 memory accesses to 6 slices as follows [2, 256, 236, 6, 23, 3]. 49 percent of accesses are in the largest equivalence class. The 502 initializations are split as follows [2, 256, 236, 5, 0, 3]. The 6 writes are split as follows [0, 0, 0, 0, 6, 0]. [2023-11-23 06:48:55,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 06:48:55,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 06:48:55,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 06:48:55,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 06:48:55,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (1/1) ... [2023-11-23 06:48:55,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 06:48:55,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:48:55,334 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) [2023-11-23 06:48:55,345 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 [2023-11-23 06:48:55,378 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_clean_up [2023-11-23 06:48:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_clean_up [2023-11-23 06:48:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2023-11-23 06:48:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2023-11-23 06:48:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 06:48:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 06:48:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 06:48:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 06:48:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 06:48:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 06:48:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 06:48:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 06:48:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 06:48:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 06:48:55,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 06:48:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 06:48:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 06:48:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 06:48:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 06:48:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 06:48:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 06:48:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-23 06:48:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-23 06:48:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 06:48:55,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 06:48:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 06:48:55,383 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 06:48:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2023-11-23 06:48:55,384 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2023-11-23 06:48:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 06:48:55,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 06:48:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 06:48:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 06:48:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 06:48:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 06:48:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 06:48:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-23 06:48:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-23 06:48:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 06:48:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 06:48:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 06:48:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 06:48:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-23 06:48:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-23 06:48:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 06:48:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 06:48:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 06:48:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 06:48:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 06:48:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 06:48:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 06:48:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 06:48:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 06:48:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 06:48:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 06:48:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 06:48:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 06:48:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 06:48:55,609 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 06:48:55,611 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 06:48:56,138 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 06:48:56,215 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 06:48:56,216 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 06:48:56,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:48:56 BoogieIcfgContainer [2023-11-23 06:48:56,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 06:48:56,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 06:48:56,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 06:48:56,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 06:48:56,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:48:53" (1/3) ... [2023-11-23 06:48:56,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110501e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:48:56, skipping insertion in model container [2023-11-23 06:48:56,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:48:54" (2/3) ... [2023-11-23 06:48:56,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110501e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:48:56, skipping insertion in model container [2023-11-23 06:48:56,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:48:56" (3/3) ... [2023-11-23 06:48:56,222 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_clean_up_harness.i [2023-11-23 06:48:56,236 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 06:48:56,237 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 06:48:56,271 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 06:48:56,276 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@503f72e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 06:48:56,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 06:48:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 49 states have internal predecessors, (62), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 06:48:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-23 06:48:56,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:48:56,287 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:48:56,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:48:56,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:48:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1947530467, now seen corresponding path program 1 times [2023-11-23 06:48:56,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:48:56,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446484370] [2023-11-23 06:48:56,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:48:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:48:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:56,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:48:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:56,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:48:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:56,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:48:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:56,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:48:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 06:48:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:56,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 06:48:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:48:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:56,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:48:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 06:48:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:48:56,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446484370] [2023-11-23 06:48:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446484370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:48:56,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:48:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 06:48:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037827250] [2023-11-23 06:48:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:48:56,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 06:48:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:48:56,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 06:48:56,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 06:48:56,930 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 49 states have internal predecessors, (62), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 06:48:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:48:57,420 INFO L93 Difference]: Finished difference Result 140 states and 189 transitions. [2023-11-23 06:48:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 06:48:57,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 4 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 49 [2023-11-23 06:48:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:48:57,429 INFO L225 Difference]: With dead ends: 140 [2023-11-23 06:48:57,430 INFO L226 Difference]: Without dead ends: 77 [2023-11-23 06:48:57,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 06:48:57,438 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 91 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 06:48:57,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 45 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 06:48:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-23 06:48:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2023-11-23 06:48:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-23 06:48:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2023-11-23 06:48:57,484 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 49 [2023-11-23 06:48:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:48:57,485 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2023-11-23 06:48:57,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 06:48:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2023-11-23 06:48:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-23 06:48:57,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:48:57,489 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:48:57,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 06:48:57,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:48:57,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:48:57,490 INFO L85 PathProgramCache]: Analyzing trace with hash -22696737, now seen corresponding path program 1 times [2023-11-23 06:48:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:48:57,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531557563] [2023-11-23 06:48:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:48:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:48:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:57,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:48:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:48:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:57,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:48:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:57,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:48:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 06:48:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:58,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 06:48:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:48:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:48:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 06:48:58,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:48:58,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531557563] [2023-11-23 06:48:58,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531557563] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:48:58,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252491177] [2023-11-23 06:48:58,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:48:58,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:48:58,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:48:58,087 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) [2023-11-23 06:48:58,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 06:48:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:58,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 2502 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 06:48:58,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:48:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:48:58,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 06:48:58,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252491177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:48:58,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 06:48:58,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-11-23 06:48:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968669149] [2023-11-23 06:48:58,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:48:58,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 06:48:58,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:48:58,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 06:48:58,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:48:58,736 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 06:48:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:48:58,887 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2023-11-23 06:48:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 06:48:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2023-11-23 06:48:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:48:58,889 INFO L225 Difference]: With dead ends: 129 [2023-11-23 06:48:58,889 INFO L226 Difference]: Without dead ends: 74 [2023-11-23 06:48:58,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:48:58,890 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 25 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 06:48:58,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 266 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 06:48:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-23 06:48:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-23 06:48:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 16 states have call successors, (16), 8 states have call predecessors, (16), 9 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-23 06:48:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2023-11-23 06:48:58,900 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 49 [2023-11-23 06:48:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:48:58,900 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2023-11-23 06:48:58,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 06:48:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2023-11-23 06:48:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 06:48:58,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:48:58,902 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:48:58,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 06:48:59,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:48:59,117 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:48:59,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:48:59,117 INFO L85 PathProgramCache]: Analyzing trace with hash 97361010, now seen corresponding path program 1 times [2023-11-23 06:48:59,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:48:59,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023162754] [2023-11-23 06:48:59,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:48:59,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:48:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:59,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:48:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:59,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:48:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:48:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:48:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 06:48:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:59,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 06:48:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:59,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:48:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:59,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:48:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 06:48:59,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:48:59,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023162754] [2023-11-23 06:48:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023162754] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:48:59,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665018146] [2023-11-23 06:48:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:48:59,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:48:59,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:48:59,522 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) [2023-11-23 06:48:59,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 06:48:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:48:59,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 2516 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 06:48:59,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:48:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 06:48:59,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 06:48:59,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665018146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:48:59,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 06:48:59,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-23 06:48:59,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770918721] [2023-11-23 06:48:59,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:48:59,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 06:48:59,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:48:59,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 06:48:59,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 06:48:59,961 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2023-11-23 06:49:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:00,183 INFO L93 Difference]: Finished difference Result 153 states and 198 transitions. [2023-11-23 06:49:00,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 06:49:00,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 55 [2023-11-23 06:49:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:00,190 INFO L225 Difference]: With dead ends: 153 [2023-11-23 06:49:00,190 INFO L226 Difference]: Without dead ends: 96 [2023-11-23 06:49:00,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 06:49:00,192 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 42 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:00,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 250 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:49:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-23 06:49:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2023-11-23 06:49:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.24) internal successors, (62), 52 states have internal predecessors, (62), 16 states have call successors, (16), 8 states have call predecessors, (16), 9 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-23 06:49:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2023-11-23 06:49:00,207 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 55 [2023-11-23 06:49:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:00,208 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2023-11-23 06:49:00,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2023-11-23 06:49:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2023-11-23 06:49:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 06:49:00,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:00,209 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:49:00,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 06:49:00,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-23 06:49:00,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:00,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2146622288, now seen corresponding path program 1 times [2023-11-23 06:49:00,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:00,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272725010] [2023-11-23 06:49:00,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:00,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:00,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:49:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:00,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:00,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:49:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:00,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 06:49:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 06:49:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:00,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:49:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 06:49:00,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:00,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272725010] [2023-11-23 06:49:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272725010] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:49:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701965179] [2023-11-23 06:49:00,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:00,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:49:00,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:49:00,763 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) [2023-11-23 06:49:00,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 06:49:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:01,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 2511 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 06:49:01,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:49:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 06:49:01,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 06:49:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701965179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:49:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 06:49:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-23 06:49:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062614687] [2023-11-23 06:49:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:49:01,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 06:49:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 06:49:01,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 06:49:01,201 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2023-11-23 06:49:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:01,392 INFO L93 Difference]: Finished difference Result 145 states and 185 transitions. [2023-11-23 06:49:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 06:49:01,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 55 [2023-11-23 06:49:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:01,396 INFO L225 Difference]: With dead ends: 145 [2023-11-23 06:49:01,396 INFO L226 Difference]: Without dead ends: 86 [2023-11-23 06:49:01,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 06:49:01,397 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 29 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:01,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 231 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:49:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-23 06:49:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2023-11-23 06:49:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 54 states have internal predecessors, (64), 16 states have call successors, (16), 8 states have call predecessors, (16), 9 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-23 06:49:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2023-11-23 06:49:01,409 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 55 [2023-11-23 06:49:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:01,410 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2023-11-23 06:49:01,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2023-11-23 06:49:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2023-11-23 06:49:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 06:49:01,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:01,415 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:49:01,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 06:49:01,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:49:01,629 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:01,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:01,629 INFO L85 PathProgramCache]: Analyzing trace with hash 491727796, now seen corresponding path program 1 times [2023-11-23 06:49:01,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:01,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286456920] [2023-11-23 06:49:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:01,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:02,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:02,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:49:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:02,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:02,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:49:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:02,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 06:49:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:02,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 06:49:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:02,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:49:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 06:49:02,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:02,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286456920] [2023-11-23 06:49:02,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286456920] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:49:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52963548] [2023-11-23 06:49:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:02,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:49:02,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:49:02,323 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) [2023-11-23 06:49:02,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 06:49:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:02,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 06:49:02,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:49:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 06:49:02,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 06:49:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52963548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:49:02,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 06:49:02,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2023-11-23 06:49:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066851985] [2023-11-23 06:49:02,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:49:02,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 06:49:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:02,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 06:49:02,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-11-23 06:49:02,848 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 06:49:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:03,085 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2023-11-23 06:49:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 06:49:03,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2023-11-23 06:49:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:03,086 INFO L225 Difference]: With dead ends: 100 [2023-11-23 06:49:03,086 INFO L226 Difference]: Without dead ends: 76 [2023-11-23 06:49:03,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2023-11-23 06:49:03,089 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 41 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:03,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 332 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:49:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-23 06:49:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-23 06:49:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-23 06:49:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2023-11-23 06:49:03,096 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 55 [2023-11-23 06:49:03,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:03,097 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2023-11-23 06:49:03,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 06:49:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2023-11-23 06:49:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-23 06:49:03,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:03,099 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:49:03,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 06:49:03,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:49:03,314 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:03,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:03,314 INFO L85 PathProgramCache]: Analyzing trace with hash -890544385, now seen corresponding path program 1 times [2023-11-23 06:49:03,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:03,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243232693] [2023-11-23 06:49:03,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:03,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:04,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:04,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:49:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:04,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:49:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:04,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 06:49:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:04,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 06:49:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:05,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:05,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 06:49:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-23 06:49:05,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:05,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243232693] [2023-11-23 06:49:05,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243232693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:49:05,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:49:05,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 06:49:05,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012006780] [2023-11-23 06:49:05,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:49:05,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 06:49:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:05,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 06:49:05,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 06:49:05,162 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-23 06:49:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:06,609 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2023-11-23 06:49:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 06:49:06,610 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2023-11-23 06:49:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:06,611 INFO L225 Difference]: With dead ends: 105 [2023-11-23 06:49:06,611 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 06:49:06,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-11-23 06:49:06,612 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 113 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:06,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 96 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 06:49:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 06:49:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2023-11-23 06:49:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 59 states have internal predecessors, (68), 20 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2023-11-23 06:49:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2023-11-23 06:49:06,627 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 61 [2023-11-23 06:49:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:06,628 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2023-11-23 06:49:06,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-23 06:49:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2023-11-23 06:49:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 06:49:06,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:06,629 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:49:06,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 06:49:06,630 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:06,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash 705814159, now seen corresponding path program 1 times [2023-11-23 06:49:06,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:06,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759952306] [2023-11-23 06:49:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:06,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:08,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:08,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:49:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:49:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 06:49:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 06:49:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 06:49:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:08,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 06:49:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-23 06:49:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:08,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759952306] [2023-11-23 06:49:08,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759952306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:49:08,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:49:08,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 06:49:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724901113] [2023-11-23 06:49:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:49:08,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 06:49:08,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:08,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 06:49:08,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-11-23 06:49:08,816 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 06:49:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:10,654 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2023-11-23 06:49:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 06:49:10,655 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 65 [2023-11-23 06:49:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:10,656 INFO L225 Difference]: With dead ends: 98 [2023-11-23 06:49:10,656 INFO L226 Difference]: Without dead ends: 96 [2023-11-23 06:49:10,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-11-23 06:49:10,657 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 120 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:10,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 136 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 06:49:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-23 06:49:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2023-11-23 06:49:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 62 states have internal predecessors, (71), 20 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2023-11-23 06:49:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2023-11-23 06:49:10,670 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 65 [2023-11-23 06:49:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:10,670 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2023-11-23 06:49:10,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-23 06:49:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2023-11-23 06:49:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 06:49:10,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:10,672 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 06:49:10,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 06:49:10,672 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:10,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:10,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1836195295, now seen corresponding path program 1 times [2023-11-23 06:49:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602192195] [2023-11-23 06:49:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:10,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:11,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:11,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:49:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:11,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:11,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:49:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:11,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 06:49:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:11,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 06:49:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:11,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:11,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 06:49:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 06:49:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-23 06:49:12,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:12,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602192195] [2023-11-23 06:49:12,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602192195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:49:12,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:49:12,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-23 06:49:12,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605142289] [2023-11-23 06:49:12,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:49:12,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 06:49:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:12,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 06:49:12,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-11-23 06:49:12,012 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 15 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-23 06:49:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:13,779 INFO L93 Difference]: Finished difference Result 181 states and 227 transitions. [2023-11-23 06:49:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 06:49:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 67 [2023-11-23 06:49:13,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:13,781 INFO L225 Difference]: With dead ends: 181 [2023-11-23 06:49:13,781 INFO L226 Difference]: Without dead ends: 95 [2023-11-23 06:49:13,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2023-11-23 06:49:13,782 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 166 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:13,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 146 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 06:49:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-23 06:49:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2023-11-23 06:49:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 60 states have internal predecessors, (68), 20 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2023-11-23 06:49:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2023-11-23 06:49:13,791 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 67 [2023-11-23 06:49:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:13,791 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2023-11-23 06:49:13,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-23 06:49:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2023-11-23 06:49:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 06:49:13,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:13,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:49:13,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 06:49:13,793 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:13,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1602235629, now seen corresponding path program 1 times [2023-11-23 06:49:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:13,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837699093] [2023-11-23 06:49:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:49:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:49:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 06:49:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 06:49:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 06:49:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:49:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 06:49:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 06:49:14,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:14,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837699093] [2023-11-23 06:49:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837699093] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:49:14,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276652220] [2023-11-23 06:49:14,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:14,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:49:14,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:49:14,463 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) [2023-11-23 06:49:14,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 06:49:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:14,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 2569 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-23 06:49:14,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:49:14,979 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-23 06:49:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 06:49:15,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 06:49:15,451 INFO L378 Elim1Store]: Elim1 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 32 treesize of output 26 [2023-11-23 06:49:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 06:49:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276652220] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 06:49:15,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 06:49:15,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 11] total 22 [2023-11-23 06:49:15,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861528328] [2023-11-23 06:49:15,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:49:15,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 06:49:15,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:15,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 06:49:15,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2023-11-23 06:49:15,489 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-23 06:49:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:15,996 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2023-11-23 06:49:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 06:49:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 79 [2023-11-23 06:49:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:15,997 INFO L225 Difference]: With dead ends: 108 [2023-11-23 06:49:15,998 INFO L226 Difference]: Without dead ends: 88 [2023-11-23 06:49:15,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 161 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2023-11-23 06:49:15,998 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:15,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 109 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 06:49:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-23 06:49:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-23 06:49:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 60 states have internal predecessors, (67), 20 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2023-11-23 06:49:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2023-11-23 06:49:16,011 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 79 [2023-11-23 06:49:16,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:16,012 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2023-11-23 06:49:16,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-23 06:49:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2023-11-23 06:49:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-23 06:49:16,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:16,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:49:16,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 06:49:16,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:49:16,231 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:16,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -915472929, now seen corresponding path program 1 times [2023-11-23 06:49:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:16,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410093126] [2023-11-23 06:49:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:16,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:16,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:16,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:49:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:16,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:16,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:49:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 06:49:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 06:49:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:16,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:49:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:16,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 06:49:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 06:49:16,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410093126] [2023-11-23 06:49:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410093126] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:49:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420946653] [2023-11-23 06:49:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:16,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:49:16,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:49:16,865 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) [2023-11-23 06:49:16,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 06:49:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:17,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 2552 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-23 06:49:17,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:49:17,345 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 19 [2023-11-23 06:49:17,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2023-11-23 06:49:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 06:49:17,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 06:49:18,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1979 treesize of output 1949 [2023-11-23 06:49:18,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5867 treesize of output 5771 [2023-11-23 06:49:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 06:49:18,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420946653] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 06:49:18,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 06:49:18,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2023-11-23 06:49:18,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586058538] [2023-11-23 06:49:18,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 06:49:18,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-23 06:49:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-23 06:49:18,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2023-11-23 06:49:18,488 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 30 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 21 states have internal predecessors, (70), 8 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-23 06:49:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:21,930 INFO L93 Difference]: Finished difference Result 168 states and 203 transitions. [2023-11-23 06:49:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 06:49:21,930 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 21 states have internal predecessors, (70), 8 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) Word has length 75 [2023-11-23 06:49:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:21,931 INFO L225 Difference]: With dead ends: 168 [2023-11-23 06:49:21,931 INFO L226 Difference]: Without dead ends: 101 [2023-11-23 06:49:21,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=222, Invalid=1848, Unknown=0, NotChecked=0, Total=2070 [2023-11-23 06:49:21,932 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 145 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 62 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:21,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 292 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1440 Invalid, 5 Unknown, 0 Unchecked, 2.0s Time] [2023-11-23 06:49:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-23 06:49:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2023-11-23 06:49:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 67 states have internal predecessors, (73), 20 states have call successors, (20), 10 states have call predecessors, (20), 12 states have return successors, (21), 18 states have call predecessors, (21), 19 states have call successors, (21) [2023-11-23 06:49:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2023-11-23 06:49:21,949 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 75 [2023-11-23 06:49:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:21,950 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2023-11-23 06:49:21,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 21 states have internal predecessors, (70), 8 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-23 06:49:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2023-11-23 06:49:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-23 06:49:21,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:21,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:49:21,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-23 06:49:22,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:49:22,162 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:22,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:22,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1374215770, now seen corresponding path program 1 times [2023-11-23 06:49:22,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:22,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079582061] [2023-11-23 06:49:22,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:22,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:49:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:49:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:22,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 06:49:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 06:49:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:23,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 06:49:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:49:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 06:49:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:23,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 06:49:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 06:49:23,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:23,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079582061] [2023-11-23 06:49:23,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079582061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:49:23,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:49:23,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 06:49:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691591639] [2023-11-23 06:49:23,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:49:23,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 06:49:23,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:23,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 06:49:23,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:49:23,135 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 10 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-23 06:49:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:24,323 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2023-11-23 06:49:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 06:49:24,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 87 [2023-11-23 06:49:24,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:24,324 INFO L225 Difference]: With dead ends: 107 [2023-11-23 06:49:24,324 INFO L226 Difference]: Without dead ends: 103 [2023-11-23 06:49:24,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-11-23 06:49:24,325 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 100 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:24,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 112 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 06:49:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-23 06:49:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2023-11-23 06:49:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 68 states have internal predecessors, (74), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (21), 18 states have call predecessors, (21), 19 states have call successors, (21) [2023-11-23 06:49:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2023-11-23 06:49:24,335 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 87 [2023-11-23 06:49:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:24,335 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2023-11-23 06:49:24,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-23 06:49:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2023-11-23 06:49:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-23 06:49:24,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:24,336 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1, 1, 1] [2023-11-23 06:49:24,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 06:49:24,336 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:24,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1389085888, now seen corresponding path program 1 times [2023-11-23 06:49:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:24,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93846094] [2023-11-23 06:49:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:24,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:24,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:49:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:24,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:49:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:24,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:24,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 06:49:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 06:49:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 06:49:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:24,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:49:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:25,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 06:49:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:25,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 06:49:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:25,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 06:49:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 06:49:25,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:25,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93846094] [2023-11-23 06:49:25,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93846094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:49:25,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:49:25,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 06:49:25,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105366552] [2023-11-23 06:49:25,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:49:25,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 06:49:25,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:25,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 06:49:25,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 06:49:25,078 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 06:49:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:26,601 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2023-11-23 06:49:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 06:49:26,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 93 [2023-11-23 06:49:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:26,602 INFO L225 Difference]: With dead ends: 150 [2023-11-23 06:49:26,602 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 06:49:26,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-11-23 06:49:26,603 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 106 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:26,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 181 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 06:49:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 06:49:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2023-11-23 06:49:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 64 states have internal predecessors, (70), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2023-11-23 06:49:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2023-11-23 06:49:26,612 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 93 [2023-11-23 06:49:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:26,612 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2023-11-23 06:49:26,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 06:49:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2023-11-23 06:49:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-23 06:49:26,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:26,613 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:49:26,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 06:49:26,613 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:26,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1854006907, now seen corresponding path program 1 times [2023-11-23 06:49:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:26,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458207603] [2023-11-23 06:49:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 06:49:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 06:49:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 06:49:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 06:49:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 06:49:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 06:49:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 06:49:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 06:49:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-23 06:49:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 06:49:28,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458207603] [2023-11-23 06:49:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458207603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:49:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020939254] [2023-11-23 06:49:28,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:28,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:49:28,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:49:28,593 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) [2023-11-23 06:49:28,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 06:49:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:29,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-23 06:49:29,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:49:29,146 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-23 06:49:29,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-23 06:49:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-23 06:49:30,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 06:49:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020939254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:49:30,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 06:49:30,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2023-11-23 06:49:30,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116105401] [2023-11-23 06:49:30,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 06:49:30,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-23 06:49:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-23 06:49:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2023-11-23 06:49:30,762 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 30 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 24 states have internal predecessors, (82), 12 states have call successors, (25), 7 states have call predecessors, (25), 9 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2023-11-23 06:49:33,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 06:49:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:36,507 INFO L93 Difference]: Finished difference Result 184 states and 212 transitions. [2023-11-23 06:49:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-23 06:49:36,507 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 24 states have internal predecessors, (82), 12 states have call successors, (25), 7 states have call predecessors, (25), 9 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) Word has length 95 [2023-11-23 06:49:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:36,509 INFO L225 Difference]: With dead ends: 184 [2023-11-23 06:49:36,509 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 06:49:36,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 175 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=419, Invalid=2887, Unknown=0, NotChecked=0, Total=3306 [2023-11-23 06:49:36,515 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 258 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 116 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:36,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 220 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2361 Invalid, 8 Unknown, 0 Unchecked, 4.4s Time] [2023-11-23 06:49:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 06:49:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2023-11-23 06:49:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 88 states have internal predecessors, (97), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 06:49:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2023-11-23 06:49:36,531 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 95 [2023-11-23 06:49:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:36,531 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2023-11-23 06:49:36,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 24 states have internal predecessors, (82), 12 states have call successors, (25), 7 states have call predecessors, (25), 9 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2023-11-23 06:49:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2023-11-23 06:49:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-23 06:49:36,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:49:36,534 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:49:36,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-23 06:49:36,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:49:36,742 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:49:36,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:49:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2056205813, now seen corresponding path program 1 times [2023-11-23 06:49:36,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:49:36,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818614750] [2023-11-23 06:49:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:49:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:49:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 06:49:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 06:49:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 06:49:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 06:49:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:49:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 06:49:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 06:49:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 06:49:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 06:49:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:49:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-23 06:49:37,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:49:37,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818614750] [2023-11-23 06:49:37,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818614750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:49:37,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:49:37,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 06:49:37,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945596081] [2023-11-23 06:49:37,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:49:37,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 06:49:37,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:49:37,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 06:49:37,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 06:49:37,880 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 06:49:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:49:39,076 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2023-11-23 06:49:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 06:49:39,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 91 [2023-11-23 06:49:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:49:39,077 INFO L225 Difference]: With dead ends: 130 [2023-11-23 06:49:39,077 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 06:49:39,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2023-11-23 06:49:39,078 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 95 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 06:49:39,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 121 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 06:49:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 06:49:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 06:49:39,078 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) [2023-11-23 06:49:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 06:49:39,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2023-11-23 06:49:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:49:39,079 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 06:49:39,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 06:49:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 06:49:39,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 06:49:39,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 06:49:39,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 06:49:39,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 06:49:40,646 INFO L899 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2023-11-23 06:49:40,646 INFO L895 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< |~#s_can_fail_allocator_static~0.base| 194)) [2023-11-23 06:49:40,646 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6876 6881) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (< |~#s_can_fail_allocator_static~0.base| 194)) [2023-11-23 06:49:40,646 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2023-11-23 06:49:40,646 INFO L899 garLoopResultBuilder]: For program point L7205-4(lines 7205 7207) no Hoare annotation was computed. [2023-11-23 06:49:40,647 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 7203 7216) the Hoare annotation is: (or (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |#memory_real#2| |old(#memory_real#2)|) (= |#memory_real#4| |old(#memory_real#4)|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#5.offset)| |#memory_$Pointer$#5.offset|) (= |#memory_$Pointer$#0.base| |old(#memory_$Pointer$#0.base)|) (= |#memory_int#0| |old(#memory_int#0)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#5| |old(#memory_int#5)|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |old(#memory_$Pointer$#0.offset)| |#memory_$Pointer$#0.offset|) (= |#memory_$Pointer$#5.base| |old(#memory_$Pointer$#5.base)|) (= |#memory_int#1| |old(#memory_int#1)|) (= |#memory_real#1| |old(#memory_real#1)|) (= |#memory_real#0| |old(#memory_real#0)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |#memory_real#5| |old(#memory_real#5)|) (= |#memory_real#3| |old(#memory_real#3)|) (= |old(#valid)| |#valid|) (= |#memory_int#3| |old(#memory_int#3)|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) (< |~#s_can_fail_allocator_static~0.base| 194)) [2023-11-23 06:49:40,647 INFO L895 garLoopResultBuilder]: At program point L7206(line 7206) the Hoare annotation is: (let ((.cse4 (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|)) (.cse5 (= |#memory_real#2| |old(#memory_real#2)|)) (.cse6 (= |#memory_real#4| |old(#memory_real#4)|)) (.cse7 (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|)) (.cse9 (= |#memory_int#4| |old(#memory_int#4)|)) (.cse10 (= |old(#memory_$Pointer$#5.offset)| |#memory_$Pointer$#5.offset|)) (.cse11 (= |#memory_$Pointer$#0.base| |old(#memory_$Pointer$#0.base)|)) (.cse12 (<= |aws_byte_buf_clean_up_#in~buf.base| aws_byte_buf_clean_up_~buf.base)) (.cse13 (= |#memory_int#0| |old(#memory_int#0)|)) (.cse14 (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|)) (.cse15 (= |#memory_int#2| |old(#memory_int#2)|)) (.cse16 (= |#memory_int#5| |old(#memory_int#5)|)) (.cse17 (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|)) (.cse18 (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|)) (.cse19 (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|)) (.cse20 (= |old(#memory_$Pointer$#0.offset)| |#memory_$Pointer$#0.offset|)) (.cse21 (= |#memory_$Pointer$#5.base| |old(#memory_$Pointer$#5.base)|)) (.cse22 (= |#memory_int#1| |old(#memory_int#1)|)) (.cse23 (= |#memory_real#1| |old(#memory_real#1)|)) (.cse24 (= |#memory_real#0| |old(#memory_real#0)|)) (.cse25 (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)) (.cse27 (= |#memory_real#5| |old(#memory_real#5)|)) (.cse28 (= |#memory_real#3| |old(#memory_real#3)|)) (.cse29 (= |old(#valid)| |#valid|)) (.cse30 (= |#memory_int#3| |old(#memory_int#3)|)) (.cse31 (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|))) (let ((.cse2 (= |aws_byte_buf_clean_up_#in~buf.base| aws_byte_buf_clean_up_~buf.base)) (.cse1 (= |aws_byte_buf_clean_up_#in~buf.offset| aws_byte_buf_clean_up_~buf.offset)) (.cse0 (and .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 (<= |aws_byte_buf_clean_up_#in~buf.base| 0))) (.cse3 (< |~#s_can_fail_allocator_static~0.base| 194))) (and (or (forall ((|v_ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset_BEFORE_CALL_18| Int)) (< (select (select |old(#memory_$Pointer$#4.base)| |v_ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base_BEFORE_CALL_26|) (+ |v_ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset_BEFORE_CALL_18| 24)) 194)) .cse0 (and .cse1 .cse2) .cse3) (or (let ((.cse26 (= aws_byte_buf_clean_up_~buf.offset 0))) (let ((.cse8 (not .cse26))) (and .cse4 .cse5 .cse6 .cse7 (or (not (= (select (select |#memory_$Pointer$#4.offset| aws_byte_buf_clean_up_~buf.base) 24) 0)) .cse8 (not (= (select (select |#memory_$Pointer$#4.base| aws_byte_buf_clean_up_~buf.base) 24) 0))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (or .cse8 .cse2) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (or .cse1 .cse26) .cse27 .cse28 .cse29 .cse30 .cse31))) .cse0 .cse3)))) [2023-11-23 06:49:40,647 INFO L899 garLoopResultBuilder]: For program point L7204-2(line 7204) no Hoare annotation was computed. [2023-11-23 06:49:40,647 INFO L895 garLoopResultBuilder]: At program point L7204-1(line 7204) the Hoare annotation is: (let ((.cse0 (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|)) (.cse1 (= |#memory_real#2| |old(#memory_real#2)|)) (.cse2 (= |#memory_real#4| |old(#memory_real#4)|)) (.cse3 (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|)) (.cse4 (= |#memory_int#4| |old(#memory_int#4)|)) (.cse5 (= |old(#memory_$Pointer$#5.offset)| |#memory_$Pointer$#5.offset|)) (.cse6 (= |#memory_$Pointer$#0.base| |old(#memory_$Pointer$#0.base)|)) (.cse7 (= |#memory_int#0| |old(#memory_int#0)|)) (.cse8 (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|)) (.cse9 (= |#memory_int#2| |old(#memory_int#2)|)) (.cse10 (= |#memory_int#5| |old(#memory_int#5)|)) (.cse11 (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|)) (.cse12 (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|)) (.cse13 (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|)) (.cse14 (= |old(#memory_$Pointer$#0.offset)| |#memory_$Pointer$#0.offset|)) (.cse15 (= |#memory_$Pointer$#5.base| |old(#memory_$Pointer$#5.base)|)) (.cse16 (= |#memory_int#1| |old(#memory_int#1)|)) (.cse17 (= |#memory_real#1| |old(#memory_real#1)|)) (.cse18 (= |#memory_real#0| |old(#memory_real#0)|)) (.cse19 (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)) (.cse20 (= |#memory_real#5| |old(#memory_real#5)|)) (.cse21 (= |#memory_real#3| |old(#memory_real#3)|)) (.cse22 (= |old(#valid)| |#valid|)) (.cse23 (= |#memory_int#3| |old(#memory_int#3)|)) (.cse24 (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |aws_byte_buf_clean_up_#in~buf.base| aws_byte_buf_clean_up_~buf.base) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= |aws_byte_buf_clean_up_#in~buf.base| 0)) (< |~#s_can_fail_allocator_static~0.base| 194) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |aws_byte_buf_clean_up_#in~buf.offset| aws_byte_buf_clean_up_~buf.offset) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= |aws_byte_buf_clean_up_#in~buf.base| aws_byte_buf_clean_up_~buf.base)))) [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point L7205-2(lines 7205 7207) no Hoare annotation was computed. [2023-11-23 06:49:40,651 INFO L895 garLoopResultBuilder]: At program point L7204(line 7204) the Hoare annotation is: (or (< |~#s_can_fail_allocator_static~0.base| 194) (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |#memory_real#2| |old(#memory_real#2)|) (= |#memory_real#4| |old(#memory_real#4)|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#5.offset)| |#memory_$Pointer$#5.offset|) (= |aws_byte_buf_clean_up_#in~buf.offset| aws_byte_buf_clean_up_~buf.offset) (= |#memory_$Pointer$#0.base| |old(#memory_$Pointer$#0.base)|) (= |#memory_int#0| |old(#memory_int#0)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#5| |old(#memory_int#5)|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |old(#memory_$Pointer$#0.offset)| |#memory_$Pointer$#0.offset|) (= |#memory_$Pointer$#5.base| |old(#memory_$Pointer$#5.base)|) (= |#memory_int#1| |old(#memory_int#1)|) (= |#memory_real#1| |old(#memory_real#1)|) (= |#memory_real#0| |old(#memory_real#0)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |#memory_real#5| |old(#memory_real#5)|) (= |#memory_real#3| |old(#memory_real#3)|) (= |old(#valid)| |#valid|) (= |#memory_int#3| |old(#memory_int#3)|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|) (= |aws_byte_buf_clean_up_#in~buf.base| aws_byte_buf_clean_up_~buf.base))) [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_clean_upEXIT(lines 7203 7216) no Hoare annotation was computed. [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point L7205(line 7205) no Hoare annotation was computed. [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point L7206-1(line 7206) no Hoare annotation was computed. [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point L7181-3(line 7181) no Hoare annotation was computed. [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point L7181-1(line 7181) no Hoare annotation was computed. [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point L7181(lines 7181 7184) no Hoare annotation was computed. [2023-11-23 06:49:40,651 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7179 7185) the Hoare annotation is: true [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point L7181-7(lines 7181 7184) no Hoare annotation was computed. [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point L7181-6(lines 7181 7182) no Hoare annotation was computed. [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point L7181-4(lines 7181 7182) no Hoare annotation was computed. [2023-11-23 06:49:40,651 INFO L899 garLoopResultBuilder]: For program point L7181-11(lines 7181 7184) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L7181-9(lines 7181 7184) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7179 7185) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L7184-2(line 7184) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L7184(line 7184) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L7184-6(line 7184) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L7184-4(line 7184) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L7184-3(line 7184) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L7184-8(line 7184) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 261) the Hoare annotation is: true [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point L7056-1(lines 7056 7058) no Hoare annotation was computed. [2023-11-23 06:49:40,652 INFO L895 garLoopResultBuilder]: At program point L7056(lines 7056 7058) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-23 06:49:40,652 INFO L899 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7055 7068) no Hoare annotation was computed. [2023-11-23 06:49:40,653 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 7055 7068) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-23 06:49:40,653 INFO L899 garLoopResultBuilder]: For program point L7063(lines 7063 7067) no Hoare annotation was computed. [2023-11-23 06:49:40,653 INFO L899 garLoopResultBuilder]: For program point L7059-1(lines 7059 7061) no Hoare annotation was computed. [2023-11-23 06:49:40,653 INFO L895 garLoopResultBuilder]: At program point L7059(lines 7059 7061) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-23 06:49:40,653 INFO L899 garLoopResultBuilder]: For program point L7063-2(lines 7055 7068) no Hoare annotation was computed. [2023-11-23 06:49:40,654 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 06:49:40,654 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 06:49:40,654 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 06:49:40,654 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 06:49:40,654 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6883 6885) the Hoare annotation is: true [2023-11-23 06:49:40,656 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2023-11-23 06:49:40,656 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 06:49:40,656 INFO L899 garLoopResultBuilder]: For program point L8770-1(lines 8770 8772) no Hoare annotation was computed. [2023-11-23 06:49:40,656 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2023-11-23 06:49:40,656 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (let ((.cse0 (<= 2 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse1 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (select (select |#memory_$Pointer$#4.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) 24)) (.cse3 (= 194 |~#s_can_fail_allocator_static~0.base|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))) (or (and .cse0 .cse1 (= .cse2 0) (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) 24) 0) .cse3 .cse4 .cse5) (and .cse0 .cse1 (= 194 .cse2) .cse3 .cse4 .cse5))) [2023-11-23 06:49:40,656 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 06:49:40,657 INFO L895 garLoopResultBuilder]: At program point L8773(lines 8773 8775) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|))) (and (<= 194 |~#s_can_fail_allocator_static~0.base|) (<= 2 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= (select .cse0 8) 0) (= (select .cse1 0) 0) (= 0 (select .cse2 24)) (= (select .cse1 16) 0) (= (select .cse0 24) 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1158#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1158#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (= (select .cse2 8) 0))) [2023-11-23 06:49:40,657 INFO L899 garLoopResultBuilder]: For program point L8773-1(lines 8773 8775) no Hoare annotation was computed. [2023-11-23 06:49:40,657 INFO L895 garLoopResultBuilder]: At program point L8777(line 8777) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|))) (and (<= 194 |~#s_can_fail_allocator_static~0.base|) (<= 2 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= (select .cse0 8) 0) (= (select .cse1 0) 0) (= 0 (select .cse2 24)) (= (select .cse1 16) 0) (= (select .cse0 24) 0) (= (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1160#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1160#1|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (= (select .cse2 8) 0))) [2023-11-23 06:49:40,657 INFO L899 garLoopResultBuilder]: For program point L8777-1(line 8777) no Hoare annotation was computed. [2023-11-23 06:49:40,657 INFO L899 garLoopResultBuilder]: For program point L8767-2(line 8767) no Hoare annotation was computed. [2023-11-23 06:49:40,657 INFO L895 garLoopResultBuilder]: At program point L8769(line 8769) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|))) (let ((.cse0 (<= 194 |~#s_can_fail_allocator_static~0.base|)) (.cse1 (<= 2 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (select .cse5 24)) (.cse3 (not (= (select .cse5 8) 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (= 0 .cse2) (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) 24) 0) .cse3 .cse4) (and .cse0 .cse1 (= 194 .cse2) .cse3 .cse4)))) [2023-11-23 06:49:40,657 INFO L899 garLoopResultBuilder]: For program point L8769-1(line 8769) no Hoare annotation was computed. [2023-11-23 06:49:40,657 INFO L895 garLoopResultBuilder]: At program point L8767(line 8767) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|))) (let ((.cse0 (<= 194 |~#s_can_fail_allocator_static~0.base|)) (.cse1 (<= 2 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (select .cse5 24)) (.cse3 (not (= (select .cse5 8) 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (= 0 .cse2) (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) 24) 0) .cse3 .cse4) (and .cse0 .cse1 (= 194 .cse2) .cse3 .cse4)))) [2023-11-23 06:49:40,658 INFO L895 garLoopResultBuilder]: At program point L8767-1(line 8767) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|))) (let ((.cse0 (<= 194 |~#s_can_fail_allocator_static~0.base|)) (.cse1 (<= 2 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (select .cse5 24)) (.cse3 (not (= (select .cse5 8) 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (= 0 .cse2) (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) 24) 0) .cse3 .cse4) (and .cse1 (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~ret1156#1| 0) .cse3 .cse4) (and .cse0 .cse1 (= 194 .cse2) .cse3 .cse4)))) [2023-11-23 06:49:40,658 INFO L895 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= 194 |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2023-11-23 06:49:40,658 INFO L899 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2023-11-23 06:49:40,658 INFO L895 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= 194 |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2023-11-23 06:49:40,658 INFO L899 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2023-11-23 06:49:40,658 INFO L899 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2023-11-23 06:49:40,658 INFO L895 garLoopResultBuilder]: At program point L8770(lines 8770 8772) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|))) (and (<= 194 |~#s_can_fail_allocator_static~0.base|) (<= 2 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1157#1.base| 0) (= (select .cse0 8) 0) (= (select .cse1 0) 0) (= 0 (select .cse2 24)) (= (select .cse1 16) 0) (= (select .cse0 24) 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1157#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (= (select .cse2 8) 0))) [2023-11-23 06:49:40,659 INFO L895 garLoopResultBuilder]: At program point L8776(line 8776) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|))) (and (<= 194 |~#s_can_fail_allocator_static~0.base|) (<= 2 |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.base|) (= (select .cse0 8) 0) (= (select .cse1 0) 0) (= 0 (select .cse2 24)) (= (select .cse1 16) 0) (= (select .cse0 24) 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_#t~mem1159#1| 0) (= |ULTIMATE.start_aws_byte_buf_clean_up_harness_~#buf~3#1.offset| 0) (= (select .cse2 8) 0))) [2023-11-23 06:49:40,659 INFO L899 garLoopResultBuilder]: For program point L8776-1(line 8776) no Hoare annotation was computed. [2023-11-23 06:49:40,661 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:49:40,662 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 06:49:40,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:49:40 BoogieIcfgContainer [2023-11-23 06:49:40,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 06:49:40,667 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 06:49:40,667 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 06:49:40,667 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 06:49:40,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:48:56" (3/4) ... [2023-11-23 06:49:40,669 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 06:49:40,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-23 06:49:40,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2023-11-23 06:49:40,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2023-11-23 06:49:40,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2023-11-23 06:49:40,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 06:49:40,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_clean_up [2023-11-23 06:49:40,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 06:49:40,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2023-11-23 06:49:40,683 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 122 nodes and edges [2023-11-23 06:49:40,684 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2023-11-23 06:49:40,684 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-23 06:49:40,685 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-23 06:49:40,686 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 06:49:40,686 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 06:49:40,687 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-23 06:49:40,688 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 06:49:41,019 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 06:49:41,019 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 06:49:41,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 06:49:41,020 INFO L158 Benchmark]: Toolchain (without parser) took 47901.07ms. Allocated memory was 176.2MB in the beginning and 956.3MB in the end (delta: 780.1MB). Free memory was 97.0MB in the beginning and 608.9MB in the end (delta: -511.8MB). Peak memory consumption was 268.3MB. Max. memory is 16.1GB. [2023-11-23 06:49:41,020 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 06:49:41,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1878.96ms. Allocated memory was 176.2MB in the beginning and 289.4MB in the end (delta: 113.2MB). Free memory was 96.9MB in the beginning and 222.5MB in the end (delta: -125.6MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2023-11-23 06:49:41,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 155.95ms. Allocated memory is still 289.4MB. Free memory was 222.5MB in the beginning and 212.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-23 06:49:41,021 INFO L158 Benchmark]: Boogie Preprocessor took 148.74ms. Allocated memory is still 289.4MB. Free memory was 210.9MB in the beginning and 196.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-23 06:49:41,021 INFO L158 Benchmark]: RCFGBuilder took 909.52ms. Allocated memory is still 289.4MB. Free memory was 196.3MB in the beginning and 144.2MB in the end (delta: 52.0MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2023-11-23 06:49:41,022 INFO L158 Benchmark]: TraceAbstraction took 44449.18ms. Allocated memory was 289.4MB in the beginning and 956.3MB in the end (delta: 666.9MB). Free memory was 143.2MB in the beginning and 741.0MB in the end (delta: -597.8MB). Peak memory consumption was 486.4MB. Max. memory is 16.1GB. [2023-11-23 06:49:41,022 INFO L158 Benchmark]: Witness Printer took 352.59ms. Allocated memory is still 956.3MB. Free memory was 741.0MB in the beginning and 608.9MB in the end (delta: 132.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2023-11-23 06:49:41,023 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1878.96ms. Allocated memory was 176.2MB in the beginning and 289.4MB in the end (delta: 113.2MB). Free memory was 96.9MB in the beginning and 222.5MB in the end (delta: -125.6MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 155.95ms. Allocated memory is still 289.4MB. Free memory was 222.5MB in the beginning and 212.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.74ms. Allocated memory is still 289.4MB. Free memory was 210.9MB in the beginning and 196.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 909.52ms. Allocated memory is still 289.4MB. Free memory was 196.3MB in the beginning and 144.2MB in the end (delta: 52.0MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. * TraceAbstraction took 44449.18ms. Allocated memory was 289.4MB in the beginning and 956.3MB in the end (delta: 666.9MB). Free memory was 143.2MB in the beginning and 741.0MB in the end (delta: -597.8MB). Peak memory consumption was 486.4MB. Max. memory is 16.1GB. * Witness Printer took 352.59ms. Allocated memory is still 956.3MB. Free memory was 741.0MB in the beginning and 608.9MB in the end (delta: 132.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8073]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8073] - GenericResultAtLocation [Line: 8559]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8559-8570] * 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]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.4s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 1421 SdHoareTripleChecker+Valid, 14.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1384 mSDsluCounter, 2537 SdHoareTripleChecker+Invalid, 13.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1989 mSDsCounter, 559 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8214 IncrementalHoareTripleChecker+Invalid, 8786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 559 mSolverCounterUnsat, 548 mSDtfsCounter, 8214 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1170 GetRequests, 892 SyntacticMatches, 10 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=13, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 71 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 195 PreInvPairs, 249 NumberOfFragments, 1183 HoareAnnotationTreeSize, 195 FomulaSimplifications, 576 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 24 FomulaSimplificationsInter, 2581 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 1439 NumberOfCodeBlocks, 1439 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1570 ConstructedInterpolants, 53 QuantifiedInterpolants, 6000 SizeOfPredicates, 41 NumberOfNonLiveVariables, 17765 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 23 InterpolantComputations, 12 PerfectInterpolantSequences, 521/596 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 RESULT: Ultimate proved your program to be correct! [2023-11-23 06:49:41,048 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