./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_empty_array_harness.i --full-output --preprocessor.use.memory.slicer false --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_from_empty_array_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 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:14:21,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:14:21,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:14:21,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:14:21,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:14:21,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:14:21,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:14:21,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:14:21,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:14:21,766 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:14:21,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:14:21,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:14:21,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:14:21,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:14:21,770 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:14:21,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:14:21,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:14:21,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:14:21,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:14:21,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:14:21,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:14:21,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:14:21,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:14:21,773 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:14:21,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:14:21,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:14:21,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:14:21,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:14:21,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:14:21,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:14:21,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:14:21,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:14:21,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:14:21,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:14:21,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:14:21,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:14:21,777 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:14:21,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:14:21,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:14:21,778 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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:14:22,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:14:22,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:14:22,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:14:22,054 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:14:22,054 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:14:22,056 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_from_empty_array_harness.i [2023-11-23 08:14:23,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:14:23,914 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:14:23,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2023-11-23 08:14:23,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf8199ff/4b608519c8a54ca89c1970333088865b/FLAGe6bdf0203 [2023-11-23 08:14:23,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf8199ff/4b608519c8a54ca89c1970333088865b [2023-11-23 08:14:23,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:14:23,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:14:23,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:14:23,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:14:23,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:14:23,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:14:23" (1/1) ... [2023-11-23 08:14:23,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e51d6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:23, skipping insertion in model container [2023-11-23 08:14:23,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:14:23" (1/1) ... [2023-11-23 08:14:24,073 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:14:24,370 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_from_empty_array_harness.i[4503,4516] [2023-11-23 08:14:24,385 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_from_empty_array_harness.i[4563,4576] [2023-11-23 08:14:25,207 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,208 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,208 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,209 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,210 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,221 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,222 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,224 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,224 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,535 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:14:25,536 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:14:25,537 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:14:25,538 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:14:25,539 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:14:25,540 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:14:25,540 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:14:25,541 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:14:25,543 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:14:25,543 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:14:25,830 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,830 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:25,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:14:25,953 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:14:25,975 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_from_empty_array_harness.i[4503,4516] [2023-11-23 08:14:25,976 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_from_empty_array_harness.i[4563,4576] [2023-11-23 08:14:26,039 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,040 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,040 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,041 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,041 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,048 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,048 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,049 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,050 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,083 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:14:26,083 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:14:26,084 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:14:26,084 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:14:26,085 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:14:26,085 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:14:26,086 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:14:26,086 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:14:26,087 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:14:26,087 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:14:26,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-23 08:14:26,158 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,158 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:14:26,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-23 08:14:26,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:14:26,431 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,431 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,431 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,431 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,432 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,432 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,432 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,432 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,433 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,433 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,433 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,433 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,433 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,434 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,434 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,434 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,434 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,434 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:14:26,442 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:14:26,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26 WrapperNode [2023-11-23 08:14:26,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:14:26,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:14:26,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:14:26,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:14:26,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,627 INFO L138 Inliner]: procedures = 689, calls = 2617, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 789 [2023-11-23 08:14:26,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:14:26,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:14:26,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:14:26,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:14:26,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:14:26,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:14:26,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:14:26,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:14:26,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (1/1) ... [2023-11-23 08:14:26,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:14:26,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:14:26,777 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 08:14:26,821 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 08:14:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2023-11-23 08:14:26,863 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2023-11-23 08:14:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:14:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:14:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:14:26,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:14:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:14:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:14:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:14:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:14:26,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:14:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:14:26,866 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:14:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:14:26,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:14:26,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:14:26,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:14:26,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:14:26,867 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:14:26,867 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:14:26,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 08:14:26,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:14:27,134 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:14:27,136 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:14:28,045 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:14:28,143 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:14:28,144 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 08:14:28,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:14:28 BoogieIcfgContainer [2023-11-23 08:14:28,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:14:28,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:14:28,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:14:28,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:14:28,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:14:23" (1/3) ... [2023-11-23 08:14:28,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64610f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:14:28, skipping insertion in model container [2023-11-23 08:14:28,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:14:26" (2/3) ... [2023-11-23 08:14:28,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64610f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:14:28, skipping insertion in model container [2023-11-23 08:14:28,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:14:28" (3/3) ... [2023-11-23 08:14:28,151 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2023-11-23 08:14:28,167 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:14:28,167 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:14:28,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:14:28,212 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;@5d2c83b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:14:28,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:14:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-23 08:14:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 08:14:28,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:28,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:14:28,224 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:28,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:28,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1558618465, now seen corresponding path program 1 times [2023-11-23 08:14:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:28,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997698392] [2023-11-23 08:14:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:28,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:28,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:28,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:28,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:28,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997698392] [2023-11-23 08:14:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997698392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:28,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:28,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 08:14:28,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639062125] [2023-11-23 08:14:28,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:28,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:14:28,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:14:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 08:14:28,952 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:14:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:29,165 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2023-11-23 08:14:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:14:29,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2023-11-23 08:14:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:29,177 INFO L225 Difference]: With dead ends: 118 [2023-11-23 08:14:29,177 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 08:14:29,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 08:14:29,189 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:29,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 55 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:14:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 08:14:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 08:14:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 08:14:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2023-11-23 08:14:29,239 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 26 [2023-11-23 08:14:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:29,240 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2023-11-23 08:14:29,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:14:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2023-11-23 08:14:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 08:14:29,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:29,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:14:29,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:14:29,242 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:29,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1394514277, now seen corresponding path program 1 times [2023-11-23 08:14:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461573981] [2023-11-23 08:14:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:29,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:29,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:29,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:29,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:29,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:29,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461573981] [2023-11-23 08:14:29,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461573981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:29,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:29,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:14:29,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140681380] [2023-11-23 08:14:29,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:29,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:14:29,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:29,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:14:29,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:14:29,905 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:14:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:30,155 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2023-11-23 08:14:30,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:14:30,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2023-11-23 08:14:30,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:30,158 INFO L225 Difference]: With dead ends: 106 [2023-11-23 08:14:30,158 INFO L226 Difference]: Without dead ends: 59 [2023-11-23 08:14:30,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:14:30,160 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 51 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:30,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 93 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:14:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-23 08:14:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-23 08:14:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 40 states have internal predecessors, (46), 14 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-23 08:14:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2023-11-23 08:14:30,176 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 26 [2023-11-23 08:14:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:30,176 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2023-11-23 08:14:30,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:14:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2023-11-23 08:14:30,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 08:14:30,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:30,178 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:30,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 08:14:30,178 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:30,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash 431704314, now seen corresponding path program 1 times [2023-11-23 08:14:30,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:30,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502823230] [2023-11-23 08:14:30,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:30,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:30,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:30,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:30,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:31,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:31,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502823230] [2023-11-23 08:14:31,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502823230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:31,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:31,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 08:14:31,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615340604] [2023-11-23 08:14:31,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:31,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:14:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:31,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:14:31,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:14:31,044 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:14:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:31,362 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2023-11-23 08:14:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:14:31,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-11-23 08:14:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:31,364 INFO L225 Difference]: With dead ends: 70 [2023-11-23 08:14:31,364 INFO L226 Difference]: Without dead ends: 68 [2023-11-23 08:14:31,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:14:31,365 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:31,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 194 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:14:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-23 08:14:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2023-11-23 08:14:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 08:14:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2023-11-23 08:14:31,380 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 32 [2023-11-23 08:14:31,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:31,380 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2023-11-23 08:14:31,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:14:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2023-11-23 08:14:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 08:14:31,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:31,382 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:31,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 08:14:31,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:31,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2121707342, now seen corresponding path program 1 times [2023-11-23 08:14:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:31,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144140558] [2023-11-23 08:14:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:32,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:32,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:32,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:32,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:32,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:32,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144140558] [2023-11-23 08:14:32,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144140558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:32,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:32,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 08:14:32,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616493784] [2023-11-23 08:14:32,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:32,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:14:32,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:32,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:14:32,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:14:32,584 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:14:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:32,979 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2023-11-23 08:14:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:14:32,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-11-23 08:14:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:32,983 INFO L225 Difference]: With dead ends: 130 [2023-11-23 08:14:32,984 INFO L226 Difference]: Without dead ends: 78 [2023-11-23 08:14:32,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:14:32,988 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 100 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:32,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 139 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:14:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-23 08:14:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2023-11-23 08:14:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 08:14:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2023-11-23 08:14:33,004 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 36 [2023-11-23 08:14:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:33,005 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2023-11-23 08:14:33,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:14:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2023-11-23 08:14:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 08:14:33,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:33,008 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:33,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:14:33,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:33,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1420642764, now seen corresponding path program 1 times [2023-11-23 08:14:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:33,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700017855] [2023-11-23 08:14:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:33,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:36,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:36,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:36,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700017855] [2023-11-23 08:14:36,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700017855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:36,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:36,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 08:14:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091525273] [2023-11-23 08:14:36,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:36,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:14:36,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:36,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:14:36,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:14:36,550 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 08:14:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:37,453 INFO L93 Difference]: Finished difference Result 169 states and 213 transitions. [2023-11-23 08:14:37,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:14:37,454 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2023-11-23 08:14:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:37,455 INFO L225 Difference]: With dead ends: 169 [2023-11-23 08:14:37,455 INFO L226 Difference]: Without dead ends: 113 [2023-11-23 08:14:37,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2023-11-23 08:14:37,456 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 144 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:37,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 199 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:14:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-23 08:14:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2023-11-23 08:14:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 08:14:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2023-11-23 08:14:37,471 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 36 [2023-11-23 08:14:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:37,472 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2023-11-23 08:14:37,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 08:14:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2023-11-23 08:14:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 08:14:37,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:37,477 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:37,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 08:14:37,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:37,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:37,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1863207282, now seen corresponding path program 1 times [2023-11-23 08:14:37,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:37,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854275133] [2023-11-23 08:14:37,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:38,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:38,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:38,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854275133] [2023-11-23 08:14:38,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854275133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:38,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:38,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 08:14:38,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676478980] [2023-11-23 08:14:38,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:38,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:14:38,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:38,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:14:38,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:14:38,303 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:14:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:38,670 INFO L93 Difference]: Finished difference Result 175 states and 222 transitions. [2023-11-23 08:14:38,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:14:38,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-11-23 08:14:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:38,672 INFO L225 Difference]: With dead ends: 175 [2023-11-23 08:14:38,672 INFO L226 Difference]: Without dead ends: 105 [2023-11-23 08:14:38,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:14:38,673 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 111 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:38,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 144 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:14:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-23 08:14:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2023-11-23 08:14:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 61 states have internal predecessors, (73), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 08:14:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2023-11-23 08:14:38,682 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 36 [2023-11-23 08:14:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:38,682 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2023-11-23 08:14:38,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:14:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2023-11-23 08:14:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 08:14:38,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:38,685 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:38,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 08:14:38,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:38,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1853256178, now seen corresponding path program 1 times [2023-11-23 08:14:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:38,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934161732] [2023-11-23 08:14:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:38,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:38,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:38,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:38,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934161732] [2023-11-23 08:14:38,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934161732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:38,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:38,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:14:38,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079946221] [2023-11-23 08:14:38,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:38,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:14:38,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:38,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:14:38,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:14:38,976 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:14:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:39,190 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2023-11-23 08:14:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:14:39,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2023-11-23 08:14:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:39,191 INFO L225 Difference]: With dead ends: 167 [2023-11-23 08:14:39,191 INFO L226 Difference]: Without dead ends: 95 [2023-11-23 08:14:39,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:14:39,192 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 60 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:39,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 98 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:14:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-23 08:14:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2023-11-23 08:14:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 61 states have internal predecessors, (72), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 08:14:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2023-11-23 08:14:39,199 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 36 [2023-11-23 08:14:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:39,199 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2023-11-23 08:14:39,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:14:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2023-11-23 08:14:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 08:14:39,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:39,201 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:39,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 08:14:39,201 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:39,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash 842138928, now seen corresponding path program 1 times [2023-11-23 08:14:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315245587] [2023-11-23 08:14:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:39,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:39,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:39,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:39,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:39,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:39,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315245587] [2023-11-23 08:14:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315245587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:39,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:39,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:14:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816705507] [2023-11-23 08:14:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:39,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:14:39,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:39,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:14:39,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:14:39,801 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:14:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:40,084 INFO L93 Difference]: Finished difference Result 154 states and 196 transitions. [2023-11-23 08:14:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:14:40,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2023-11-23 08:14:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:40,086 INFO L225 Difference]: With dead ends: 154 [2023-11-23 08:14:40,086 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 08:14:40,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:14:40,087 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 44 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:40,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 118 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:14:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 08:14:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2023-11-23 08:14:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 59 states have internal predecessors, (68), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 08:14:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2023-11-23 08:14:40,096 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 36 [2023-11-23 08:14:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:40,097 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2023-11-23 08:14:40,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:14:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2023-11-23 08:14:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 08:14:40,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:40,099 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:40,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 08:14:40,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:40,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1574017271, now seen corresponding path program 1 times [2023-11-23 08:14:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:40,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000549781] [2023-11-23 08:14:40,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:40,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:40,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:40,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:40,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:40,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000549781] [2023-11-23 08:14:40,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000549781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:40,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:40,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 08:14:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341390165] [2023-11-23 08:14:40,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:40,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:14:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:40,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:14:40,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:14:40,832 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:14:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:41,231 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2023-11-23 08:14:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:14:41,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2023-11-23 08:14:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:41,233 INFO L225 Difference]: With dead ends: 100 [2023-11-23 08:14:41,233 INFO L226 Difference]: Without dead ends: 98 [2023-11-23 08:14:41,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:14:41,233 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 68 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:41,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 246 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:14:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-23 08:14:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2023-11-23 08:14:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 08:14:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2023-11-23 08:14:41,239 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 38 [2023-11-23 08:14:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:41,240 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2023-11-23 08:14:41,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 08:14:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2023-11-23 08:14:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 08:14:41,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:41,243 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:41,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 08:14:41,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:41,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1967044281, now seen corresponding path program 1 times [2023-11-23 08:14:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:41,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698318046] [2023-11-23 08:14:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:41,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:42,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:42,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698318046] [2023-11-23 08:14:42,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698318046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:42,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:42,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:14:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722092148] [2023-11-23 08:14:42,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:42,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:14:42,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:42,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:14:42,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:14:42,232 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:14:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:42,520 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2023-11-23 08:14:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:14:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-11-23 08:14:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:42,522 INFO L225 Difference]: With dead ends: 158 [2023-11-23 08:14:42,522 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 08:14:42,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:14:42,523 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 52 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:42,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 144 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:14:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 08:14:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2023-11-23 08:14:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 56 states have internal predecessors, (66), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-23 08:14:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2023-11-23 08:14:42,529 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 38 [2023-11-23 08:14:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:42,529 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2023-11-23 08:14:42,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 08:14:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2023-11-23 08:14:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-23 08:14:42,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:42,530 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:42,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 08:14:42,530 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:42,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1153168955, now seen corresponding path program 1 times [2023-11-23 08:14:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:42,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677921782] [2023-11-23 08:14:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:42,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:14:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:14:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:14:42,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677921782] [2023-11-23 08:14:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677921782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:42,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:42,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:14:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117315948] [2023-11-23 08:14:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:42,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:14:42,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:14:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:14:42,869 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:14:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:43,065 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2023-11-23 08:14:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:14:43,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2023-11-23 08:14:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:43,067 INFO L225 Difference]: With dead ends: 106 [2023-11-23 08:14:43,067 INFO L226 Difference]: Without dead ends: 76 [2023-11-23 08:14:43,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:14:43,068 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 59 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:43,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 90 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:14:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-23 08:14:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-23 08:14:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 56 states have internal predecessors, (65), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-23 08:14:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2023-11-23 08:14:43,077 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 43 [2023-11-23 08:14:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:43,077 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2023-11-23 08:14:43,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 08:14:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2023-11-23 08:14:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-23 08:14:43,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:43,079 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:43,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 08:14:43,079 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:43,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1926942032, now seen corresponding path program 1 times [2023-11-23 08:14:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:43,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069635806] [2023-11-23 08:14:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:43,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:43,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:14:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:43,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:14:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 08:14:43,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:43,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069635806] [2023-11-23 08:14:43,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069635806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:43,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:43,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 08:14:43,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868133386] [2023-11-23 08:14:43,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:43,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:14:43,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:43,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:14:43,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:14:43,661 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:14:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:43,941 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2023-11-23 08:14:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:14:43,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2023-11-23 08:14:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:43,942 INFO L225 Difference]: With dead ends: 90 [2023-11-23 08:14:43,942 INFO L226 Difference]: Without dead ends: 88 [2023-11-23 08:14:43,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:14:43,943 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:43,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 193 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:14:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-23 08:14:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2023-11-23 08:14:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 15 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-23 08:14:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2023-11-23 08:14:43,948 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 49 [2023-11-23 08:14:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:43,949 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2023-11-23 08:14:43,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:14:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2023-11-23 08:14:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 08:14:43,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:43,949 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:43,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 08:14:43,950 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:43,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1952024056, now seen corresponding path program 1 times [2023-11-23 08:14:43,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:43,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527770798] [2023-11-23 08:14:43,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:43,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:44,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:44,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:44,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:14:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:44,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:14:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:14:45,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527770798] [2023-11-23 08:14:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527770798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 08:14:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278677245] [2023-11-23 08:14:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:45,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:14:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:14:45,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:14:45,129 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:14:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:45,529 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2023-11-23 08:14:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:14:45,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2023-11-23 08:14:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:45,531 INFO L225 Difference]: With dead ends: 126 [2023-11-23 08:14:45,531 INFO L226 Difference]: Without dead ends: 94 [2023-11-23 08:14:45,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:14:45,532 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 84 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:45,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 94 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:14:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-23 08:14:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2023-11-23 08:14:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 67 states have internal predecessors, (73), 15 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-23 08:14:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2023-11-23 08:14:45,539 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 53 [2023-11-23 08:14:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:45,539 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2023-11-23 08:14:45,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:14:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2023-11-23 08:14:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 08:14:45,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:45,540 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:45,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 08:14:45,540 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:45,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:45,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1250959478, now seen corresponding path program 1 times [2023-11-23 08:14:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:45,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639775802] [2023-11-23 08:14:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:46,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:46,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:14:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:47,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:14:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 08:14:47,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639775802] [2023-11-23 08:14:47,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639775802] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:14:47,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987906837] [2023-11-23 08:14:47,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:47,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:14:47,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:14:47,325 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 08:14:47,326 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 08:14:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:48,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-23 08:14:48,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:14:48,210 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 55 treesize of output 50 [2023-11-23 08:14:48,222 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 55 treesize of output 50 [2023-11-23 08:14:48,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 65 [2023-11-23 08:14:48,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 65 [2023-11-23 08:14:48,397 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:14:48,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 122 [2023-11-23 08:14:48,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 110 [2023-11-23 08:14:48,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 35 [2023-11-23 08:14:48,488 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:14:48,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 110 [2023-11-23 08:14:48,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:14:48,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 18 [2023-11-23 08:14:48,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-23 08:14:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:14:50,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:14:52,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987906837] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:14:52,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:14:52,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2023-11-23 08:14:52,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794414953] [2023-11-23 08:14:52,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:14:52,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-23 08:14:52,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:52,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-23 08:14:52,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=987, Unknown=1, NotChecked=0, Total=1122 [2023-11-23 08:14:52,564 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 28 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-23 08:14:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:55,936 INFO L93 Difference]: Finished difference Result 238 states and 285 transitions. [2023-11-23 08:14:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-23 08:14:55,936 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) Word has length 53 [2023-11-23 08:14:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:55,938 INFO L225 Difference]: With dead ends: 238 [2023-11-23 08:14:55,938 INFO L226 Difference]: Without dead ends: 199 [2023-11-23 08:14:55,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=491, Invalid=2588, Unknown=1, NotChecked=0, Total=3080 [2023-11-23 08:14:55,940 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 329 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:55,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 139 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-23 08:14:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-11-23 08:14:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 155. [2023-11-23 08:14:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 111 states have (on average 1.162162162162162) internal successors, (129), 116 states have internal predecessors, (129), 26 states have call successors, (26), 13 states have call predecessors, (26), 17 states have return successors, (29), 25 states have call predecessors, (29), 24 states have call successors, (29) [2023-11-23 08:14:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2023-11-23 08:14:55,956 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 53 [2023-11-23 08:14:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:55,957 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2023-11-23 08:14:55,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-23 08:14:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2023-11-23 08:14:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 08:14:55,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:55,958 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:55,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 08:14:56,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 08:14:56,159 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:56,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2032890568, now seen corresponding path program 1 times [2023-11-23 08:14:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:56,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052059274] [2023-11-23 08:14:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:57,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:57,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:14:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:57,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:14:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:14:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:57,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052059274] [2023-11-23 08:14:57,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052059274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:57,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:57,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 08:14:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432495251] [2023-11-23 08:14:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:57,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:14:57,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:14:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:14:57,223 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:14:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:57,624 INFO L93 Difference]: Finished difference Result 249 states and 291 transitions. [2023-11-23 08:14:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:14:57,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2023-11-23 08:14:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:57,625 INFO L225 Difference]: With dead ends: 249 [2023-11-23 08:14:57,625 INFO L226 Difference]: Without dead ends: 153 [2023-11-23 08:14:57,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:14:57,627 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 119 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:57,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 86 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:14:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-23 08:14:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2023-11-23 08:14:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 106 states have internal predecessors, (114), 26 states have call successors, (26), 13 states have call predecessors, (26), 16 states have return successors, (28), 25 states have call predecessors, (28), 24 states have call successors, (28) [2023-11-23 08:14:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2023-11-23 08:14:57,641 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 53 [2023-11-23 08:14:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:57,646 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2023-11-23 08:14:57,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:14:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2023-11-23 08:14:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 08:14:57,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:57,647 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:57,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 08:14:57,648 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:57,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash -541430014, now seen corresponding path program 1 times [2023-11-23 08:14:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:57,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715678030] [2023-11-23 08:14:57,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:57,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:58,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:58,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:58,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:58,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:14:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:14:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:58,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:14:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 08:14:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715678030] [2023-11-23 08:14:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715678030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:58,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:58,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:14:58,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406286970] [2023-11-23 08:14:58,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:58,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:14:58,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:14:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:14:58,577 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:14:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:58,851 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2023-11-23 08:14:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:14:58,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2023-11-23 08:14:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:58,852 INFO L225 Difference]: With dead ends: 155 [2023-11-23 08:14:58,853 INFO L226 Difference]: Without dead ends: 153 [2023-11-23 08:14:58,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:14:58,853 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:58,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 98 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:14:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-23 08:14:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2023-11-23 08:14:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.1111111111111112) internal successors, (120), 112 states have internal predecessors, (120), 26 states have call successors, (26), 15 states have call predecessors, (26), 18 states have return successors, (28), 25 states have call predecessors, (28), 24 states have call successors, (28) [2023-11-23 08:14:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2023-11-23 08:14:58,893 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 55 [2023-11-23 08:14:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:58,893 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2023-11-23 08:14:58,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:14:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2023-11-23 08:14:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 08:14:58,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:58,895 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:58,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 08:14:58,895 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:58,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:58,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1082887457, now seen corresponding path program 1 times [2023-11-23 08:14:58,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255599899] [2023-11-23 08:14:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:14:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:14:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:14:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:14:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:14:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:59,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:14:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:14:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 08:14:59,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:14:59,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255599899] [2023-11-23 08:14:59,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255599899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:14:59,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:14:59,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 08:14:59,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177850102] [2023-11-23 08:14:59,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:14:59,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:14:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:14:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:14:59,560 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:14:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:14:59,935 INFO L93 Difference]: Finished difference Result 177 states and 199 transitions. [2023-11-23 08:14:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:14:59,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2023-11-23 08:14:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:14:59,937 INFO L225 Difference]: With dead ends: 177 [2023-11-23 08:14:59,937 INFO L226 Difference]: Without dead ends: 175 [2023-11-23 08:14:59,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:14:59,938 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:14:59,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 245 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:14:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-23 08:14:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 160. [2023-11-23 08:14:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 114 states have (on average 1.105263157894737) internal successors, (126), 119 states have internal predecessors, (126), 26 states have call successors, (26), 15 states have call predecessors, (26), 19 states have return successors, (29), 25 states have call predecessors, (29), 24 states have call successors, (29) [2023-11-23 08:14:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2023-11-23 08:14:59,958 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 55 [2023-11-23 08:14:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:14:59,958 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2023-11-23 08:14:59,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 08:14:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2023-11-23 08:14:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 08:14:59,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:14:59,961 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:14:59,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 08:14:59,962 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:14:59,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:14:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1475914467, now seen corresponding path program 1 times [2023-11-23 08:14:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:14:59,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465878421] [2023-11-23 08:14:59,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:14:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:15:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:00,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:15:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:15:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:00,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:15:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:00,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:15:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:15:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:15:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465878421] [2023-11-23 08:15:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465878421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:15:01,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:15:01,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 08:15:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231697264] [2023-11-23 08:15:01,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:15:01,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:15:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:15:01,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:15:01,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:15:01,075 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:15:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:15:01,399 INFO L93 Difference]: Finished difference Result 227 states and 254 transitions. [2023-11-23 08:15:01,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:15:01,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 55 [2023-11-23 08:15:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:15:01,401 INFO L225 Difference]: With dead ends: 227 [2023-11-23 08:15:01,401 INFO L226 Difference]: Without dead ends: 155 [2023-11-23 08:15:01,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:15:01,402 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 70 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:15:01,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 68 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:15:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-23 08:15:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2023-11-23 08:15:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 109 states have (on average 1.0825688073394495) internal successors, (118), 113 states have internal predecessors, (118), 25 states have call successors, (25), 15 states have call predecessors, (25), 18 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2023-11-23 08:15:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2023-11-23 08:15:01,423 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 55 [2023-11-23 08:15:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:15:01,423 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2023-11-23 08:15:01,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 08:15:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2023-11-23 08:15:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-23 08:15:01,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:15:01,427 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:15:01,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 08:15:01,427 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:15:01,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:15:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2143728590, now seen corresponding path program 1 times [2023-11-23 08:15:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:15:01,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66674060] [2023-11-23 08:15:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:15:01,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:15:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:02,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:02,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:02,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:15:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:02,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:15:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:02,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:15:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:02,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:15:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:02,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:15:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:02,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:15:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 08:15:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:15:02,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66674060] [2023-11-23 08:15:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66674060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:15:02,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:15:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 08:15:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631175280] [2023-11-23 08:15:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:15:02,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:15:02,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:15:02,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:15:02,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:15:02,759 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:15:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:15:03,085 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2023-11-23 08:15:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:15:03,087 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2023-11-23 08:15:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:15:03,088 INFO L225 Difference]: With dead ends: 163 [2023-11-23 08:15:03,088 INFO L226 Difference]: Without dead ends: 161 [2023-11-23 08:15:03,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:15:03,089 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:15:03,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 111 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:15:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-23 08:15:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-11-23 08:15:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 115 states have (on average 1.0782608695652174) internal successors, (124), 119 states have internal predecessors, (124), 25 states have call successors, (25), 17 states have call predecessors, (25), 20 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2023-11-23 08:15:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2023-11-23 08:15:03,104 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 61 [2023-11-23 08:15:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:15:03,104 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2023-11-23 08:15:03,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:15:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2023-11-23 08:15:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 08:15:03,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:15:03,105 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 08:15:03,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 08:15:03,106 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:15:03,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:15:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1869516581, now seen corresponding path program 1 times [2023-11-23 08:15:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:15:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966960068] [2023-11-23 08:15:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:15:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:15:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:05,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:05,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:15:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:05,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:15:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:05,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:15:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:05,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:15:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:15:06,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:15:06,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966960068] [2023-11-23 08:15:06,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966960068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:15:06,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:15:06,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 08:15:06,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945976239] [2023-11-23 08:15:06,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:15:06,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:15:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:15:06,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:15:06,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:15:06,261 INFO L87 Difference]: Start difference. First operand 161 states and 176 transitions. Second operand has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 08:15:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:15:07,079 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2023-11-23 08:15:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:15:07,080 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2023-11-23 08:15:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:15:07,081 INFO L225 Difference]: With dead ends: 207 [2023-11-23 08:15:07,081 INFO L226 Difference]: Without dead ends: 151 [2023-11-23 08:15:07,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-11-23 08:15:07,082 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 109 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:15:07,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 132 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:15:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-23 08:15:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2023-11-23 08:15:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 104 states have internal predecessors, (108), 24 states have call successors, (24), 17 states have call predecessors, (24), 18 states have return successors, (24), 23 states have call predecessors, (24), 22 states have call successors, (24) [2023-11-23 08:15:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2023-11-23 08:15:07,103 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 59 [2023-11-23 08:15:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:15:07,104 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2023-11-23 08:15:07,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 08:15:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2023-11-23 08:15:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 08:15:07,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:15:07,105 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:15:07,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 08:15:07,106 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:15:07,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:15:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash -99594656, now seen corresponding path program 1 times [2023-11-23 08:15:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:15:07,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847604702] [2023-11-23 08:15:07,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:15:07,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:15:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:07,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:07,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:07,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:15:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:07,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:15:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:07,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:15:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:07,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:15:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:15:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:15:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:15:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 08:15:07,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:15:07,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847604702] [2023-11-23 08:15:07,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847604702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:15:07,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:15:07,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:15:07,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093349015] [2023-11-23 08:15:07,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:15:07,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:15:07,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:15:07,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:15:07,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:15:07,910 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:15:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:15:08,203 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2023-11-23 08:15:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:15:08,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 67 [2023-11-23 08:15:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:15:08,204 INFO L225 Difference]: With dead ends: 155 [2023-11-23 08:15:08,205 INFO L226 Difference]: Without dead ends: 153 [2023-11-23 08:15:08,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:15:08,206 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:15:08,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 104 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:15:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-23 08:15:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2023-11-23 08:15:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.0555555555555556) internal successors, (114), 110 states have internal predecessors, (114), 24 states have call successors, (24), 19 states have call predecessors, (24), 20 states have return successors, (24), 23 states have call predecessors, (24), 22 states have call successors, (24) [2023-11-23 08:15:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2023-11-23 08:15:08,226 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 67 [2023-11-23 08:15:08,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:15:08,226 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2023-11-23 08:15:08,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:15:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2023-11-23 08:15:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-23 08:15:08,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:15:08,227 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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] [2023-11-23 08:15:08,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 08:15:08,228 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:15:08,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:15:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash 897140082, now seen corresponding path program 1 times [2023-11-23 08:15:08,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:15:08,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2361900] [2023-11-23 08:15:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:15:08,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:15:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:15:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:15:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:15:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:15:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:15:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:15:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:15:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:15:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 08:15:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:15:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2361900] [2023-11-23 08:15:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2361900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:15:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797972282] [2023-11-23 08:15:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:15:09,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:15:09,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:15:09,647 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 08:15:09,649 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 08:15:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:10,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 2537 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-23 08:15:10,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:15:10,229 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 51 treesize of output 46 [2023-11-23 08:15:10,238 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 56 treesize of output 51 [2023-11-23 08:15:10,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2023-11-23 08:15:10,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2023-11-23 08:15:10,326 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:15:10,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 105 [2023-11-23 08:15:10,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2023-11-23 08:15:10,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 138 [2023-11-23 08:15:10,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 29 [2023-11-23 08:15:27,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:15:27,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 168 [2023-11-23 08:15:28,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:15:28,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 256 treesize of output 550 [2023-11-23 08:15:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-23 08:15:33,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:15:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797972282] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:15:33,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:15:33,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2023-11-23 08:15:33,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044539696] [2023-11-23 08:15:33,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:15:33,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-23 08:15:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:15:33,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-23 08:15:33,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1233, Unknown=1, NotChecked=0, Total=1332 [2023-11-23 08:15:33,600 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand has 30 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 11 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (19), 10 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-23 08:15:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:15:37,899 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2023-11-23 08:15:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-23 08:15:37,899 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 11 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (19), 10 states have call predecessors, (19), 9 states have call successors, (19) Word has length 74 [2023-11-23 08:15:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:15:37,900 INFO L225 Difference]: With dead ends: 162 [2023-11-23 08:15:37,900 INFO L226 Difference]: Without dead ends: 86 [2023-11-23 08:15:37,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 107 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=325, Invalid=3334, Unknown=1, NotChecked=0, Total=3660 [2023-11-23 08:15:37,902 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 141 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:15:37,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 221 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-23 08:15:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-23 08:15:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-23 08:15:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 61 states have internal predecessors, (62), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-23 08:15:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2023-11-23 08:15:37,915 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 74 [2023-11-23 08:15:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:15:37,915 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2023-11-23 08:15:37,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 11 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (19), 10 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-23 08:15:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2023-11-23 08:15:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-23 08:15:37,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:15:37,917 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:15:37,939 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 08:15:38,136 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,SelfDestructingSolverStorable21 [2023-11-23 08:15:38,136 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:15:38,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:15:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1679443915, now seen corresponding path program 1 times [2023-11-23 08:15:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:15:38,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492747149] [2023-11-23 08:15:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:15:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:15:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:15:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:15:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:15:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:15:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:15:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:15:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:15:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:15:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:15:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:15:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:15:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-23 08:15:39,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:15:39,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492747149] [2023-11-23 08:15:39,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492747149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:15:39,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:15:39,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 08:15:39,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795892842] [2023-11-23 08:15:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:15:39,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:15:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:15:39,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:15:39,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:15:39,553 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-23 08:15:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:15:39,923 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2023-11-23 08:15:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:15:39,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 96 [2023-11-23 08:15:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:15:39,925 INFO L225 Difference]: With dead ends: 116 [2023-11-23 08:15:39,925 INFO L226 Difference]: Without dead ends: 79 [2023-11-23 08:15:39,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:15:39,926 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:15:39,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 116 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:15:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-23 08:15:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-23 08:15:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.0) internal successors, (54), 54 states have internal predecessors, (54), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 08:15:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2023-11-23 08:15:39,951 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 96 [2023-11-23 08:15:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:15:39,951 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2023-11-23 08:15:39,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-23 08:15:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2023-11-23 08:15:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-23 08:15:39,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:15:39,953 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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] [2023-11-23 08:15:39,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-23 08:15:39,953 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:15:39,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:15:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1886066618, now seen corresponding path program 1 times [2023-11-23 08:15:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:15:39,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627385626] [2023-11-23 08:15:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:15:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:15:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:15:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 08:15:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 08:15:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:15:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:15:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:15:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:15:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:15:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:15:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:15:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:15:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:15:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:15:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-23 08:15:42,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:15:42,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627385626] [2023-11-23 08:15:42,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627385626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:15:42,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:15:42,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 08:15:42,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98359536] [2023-11-23 08:15:42,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:15:42,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:15:42,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:15:42,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:15:42,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:15:42,280 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-23 08:15:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:15:42,781 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2023-11-23 08:15:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 08:15:42,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 102 [2023-11-23 08:15:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:15:42,782 INFO L225 Difference]: With dead ends: 79 [2023-11-23 08:15:42,782 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 08:15:42,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:15:42,783 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:15:42,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 155 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:15:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 08:15:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 08:15:42,784 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 08:15:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 08:15:42,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2023-11-23 08:15:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:15:42,785 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 08:15:42,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-23 08:15:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 08:15:42,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 08:15:42,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 08:15:42,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-23 08:15:42,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 08:16:02,521 WARN L293 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 120 DAG size of output: 66 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-23 08:16:02,952 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6882 6887) the Hoare annotation is: (or (and (forall ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 24)) 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 8)) 0))) (forall ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (let ((.cse0 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|)) (.cse1 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 8))) (or (not (= (select .cse0 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 24)) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) .cse1) 0)) (not (= 0 (select .cse0 .cse1))))))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2023-11-23 08:16:02,952 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2023-11-23 08:16:02,952 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2023-11-23 08:16:02,953 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (and (forall ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 24)) 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 8)) 0))) (forall ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (let ((.cse0 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|)) (.cse1 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 8))) (or (not (= (select .cse0 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 24)) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) .cse1) 0)) (not (= 0 (select .cse0 .cse1))))))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2023-11-23 08:16:02,953 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2023-11-23 08:16:02,953 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2023-11-23 08:16:02,953 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2023-11-23 08:16:02,953 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2023-11-23 08:16:02,953 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2023-11-23 08:16:02,953 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2023-11-23 08:16:02,954 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7375 7381) the Hoare annotation is: true [2023-11-23 08:16:02,954 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2023-11-23 08:16:02,954 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2023-11-23 08:16:02,954 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2023-11-23 08:16:02,954 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2023-11-23 08:16:02,954 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2023-11-23 08:16:02,954 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2023-11-23 08:16:02,954 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2023-11-23 08:16:02,955 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2023-11-23 08:16:02,955 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2023-11-23 08:16:02,955 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 08:16:02,955 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 08:16:02,955 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 08:16:02,955 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 08:16:02,955 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-23 08:16:02,956 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-23 08:16:02,956 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 08:16:02,956 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2023-11-23 08:16:02,956 INFO L899 garLoopResultBuilder]: For program point L8219-1(line 8219) no Hoare annotation was computed. [2023-11-23 08:16:02,956 INFO L895 garLoopResultBuilder]: At program point L8219(line 8219) the Hoare annotation is: (and (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 8)) 0)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 24)) 0))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 8)) (.cse0 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|))) (and (= 0 (select .cse0 .cse1)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) .cse1) 0) (= (select .cse0 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 24)) 0))))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) [2023-11-23 08:16:02,956 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2023-11-23 08:16:02,957 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse10 (select .cse5 8)) (.cse4 (select .cse3 8))) (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (= .cse4 0)) (.cse2 (= .cse10 0))) (let ((.cse1 (and .cse7 .cse2)) (.cse0 (select .cse6 16))) (and (or (< .cse0 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse0) 18446744073709551616)))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963968)) .cse1) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse2) .cse1) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse3 24) 0) (or (= .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (not (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse0) (= (select .cse5 24) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (or .cse7 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 8))) (let ((.cse8 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|)) (.cse11 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|) .cse9))) (and (= (select .cse8 .cse9) .cse10) (= .cse11 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse8 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 24)) 0) (= .cse4 .cse11)))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))))) [2023-11-23 08:16:02,957 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 08:16:02,957 INFO L895 garLoopResultBuilder]: At program point L8230(line 8230) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse1 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse5 (select .cse3 8))) (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse4 (= .cse5 0)) (.cse2 (select .cse1 16))) (and (= (select .cse0 24) 0) (= (select .cse1 0) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0)) (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse0 8) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= (select .cse3 24) 0) (or .cse4 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (or (< .cse2 (+ (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616)) 36028797018963968)) .cse4 (< .cse2 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse2) 18446744073709551616))))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-23 08:16:02,958 INFO L895 garLoopResultBuilder]: At program point L8963(line 8963) the Hoare annotation is: (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 8)) 0)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 24)) 0))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 8)) (.cse0 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|))) (and (= 0 (select .cse0 .cse1)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) .cse1) 0) (= (select .cse0 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_3| 24)) 0))))) [2023-11-23 08:16:02,958 INFO L899 garLoopResultBuilder]: For program point L8963-1(line 8963) no Hoare annotation was computed. [2023-11-23 08:16:02,958 INFO L895 garLoopResultBuilder]: At program point L8969(lines 8969 8971) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse9 (select .cse4 8)) (.cse11 (select .cse3 8))) (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (= .cse11 0)) (.cse2 (= .cse9 0))) (let ((.cse1 (and .cse6 .cse2)) (.cse0 (select .cse5 16))) (and (or (< .cse0 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse0) 18446744073709551616)))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963968)) .cse1) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse2) .cse1) (= (select .cse3 24) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1219#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse0) (= (select .cse4 24) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse5 0) 0) (or .cse6 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 8))) (let ((.cse7 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|)) (.cse10 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|) .cse8))) (and (= (select .cse7 .cse8) .cse9) (= .cse10 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse7 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 24)) 0) (= .cse11 .cse10)))))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1219#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))))) [2023-11-23 08:16:02,958 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2023-11-23 08:16:02,958 INFO L899 garLoopResultBuilder]: For program point L8969-1(lines 8969 8971) no Hoare annotation was computed. [2023-11-23 08:16:02,959 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse10 (select .cse5 8)) (.cse4 (select .cse3 8))) (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (= .cse4 0)) (.cse2 (= .cse10 0))) (let ((.cse1 (and .cse7 .cse2)) (.cse0 (select .cse6 16))) (and (or (< .cse0 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse0) 18446744073709551616)))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963968)) .cse1) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse2) .cse1) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse3 24) 0) (or (= .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (not (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse0) (= (select .cse5 24) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (or .cse7 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 8))) (let ((.cse8 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|)) (.cse11 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|) .cse9))) (and (= (select .cse8 .cse9) .cse10) (= .cse11 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse8 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 24)) 0) (= .cse4 .cse11)))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))))) [2023-11-23 08:16:02,959 INFO L899 garLoopResultBuilder]: For program point L8230-2(line 8230) no Hoare annotation was computed. [2023-11-23 08:16:02,959 INFO L895 garLoopResultBuilder]: At program point L8967(line 8967) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse16 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse7 (select .cse16 8)) (.cse0 (select .cse15 16)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse9 (select .cse17 8)) (.cse1 (= (select .cse17 24) 0)) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0))) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1217#1| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse0)) (.cse10 (= .cse7 0)) (.cse11 (= (select .cse16 24) 0)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse13 (= (select .cse15 0) 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and (or (< .cse0 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse0) 18446744073709551616)))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963968))) .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 8))) (let ((.cse5 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|)) (.cse8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|) .cse6))) (and (= (select .cse5 .cse6) .cse7) (= .cse8 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse5 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 24)) 0) (= .cse9 .cse8))))) .cse10 .cse11 .cse12 .cse13 .cse14) (and (= .cse9 0) .cse1 .cse2 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 .cse14))))) [2023-11-23 08:16:02,959 INFO L895 garLoopResultBuilder]: At program point L8230-1(line 8230) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse16 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse1 (select .cse18 16)) (.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse0 (= (select .cse17 24) 0)) (.cse2 (= (select .cse18 0) 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse4 (= .cse1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (.cse6 (= (select .cse17 8) 0)) (.cse15 (select .cse16 8)) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0))) (.cse8 (= (select .cse16 24) 0)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1060#1| 1)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (or (< .cse1 (+ (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)) 36028797018963968)) (< .cse1 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse1) 18446744073709551616))))) .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse15 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse15 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) [2023-11-23 08:16:02,960 INFO L899 garLoopResultBuilder]: For program point L8967-1(line 8967) no Hoare annotation was computed. [2023-11-23 08:16:02,960 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2023-11-23 08:16:02,960 INFO L899 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2023-11-23 08:16:02,960 INFO L899 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2023-11-23 08:16:02,960 INFO L895 garLoopResultBuilder]: At program point L8966-1(line 8966) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse16 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse16 8)) (.cse0 (select .cse15 16)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse8 (select .cse17 8)) (.cse1 (= (select .cse17 24) 0)) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0))) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse0)) (.cse9 (= .cse6 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1216#1| 1)) (.cse11 (= (select .cse16 24) 0)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse13 (= (select .cse15 0) 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and (or (< .cse0 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse0) 18446744073709551616)))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963968))) .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse3 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 8))) (let ((.cse4 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|)) (.cse7 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|) .cse5))) (and (= (select .cse4 .cse5) .cse6) (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 24)) 0) (= .cse8 .cse7))))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (= .cse8 0) .cse1 .cse2 .cse3 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) [2023-11-23 08:16:02,961 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse10 (select .cse5 8)) (.cse4 (select .cse3 8))) (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (= .cse4 0)) (.cse2 (= .cse10 0))) (let ((.cse1 (and .cse7 .cse2)) (.cse0 (select .cse6 16))) (and (or (< .cse0 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse0) 18446744073709551616)))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963968)) .cse1) (= (+ |ULTIMATE.start_assert_bytes_match_#t~mem594#1| (* (div |ULTIMATE.start_assert_bytes_match_#t~mem593#1| 256) 256)) (+ (* (div |ULTIMATE.start_assert_bytes_match_#t~mem594#1| 256) 256) |ULTIMATE.start_assert_bytes_match_#t~mem593#1|)) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse2) .cse1) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse3 24) 0) (or (= .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (not (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse0) (= (select .cse5 24) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (or .cse7 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 8))) (let ((.cse8 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|)) (.cse11 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|) .cse9))) (and (= (select .cse8 .cse9) .cse10) (= .cse11 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse8 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 24)) 0) (= .cse4 .cse11)))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))))) [2023-11-23 08:16:02,961 INFO L899 garLoopResultBuilder]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2023-11-23 08:16:02,961 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse10 (select .cse5 8)) (.cse4 (select .cse3 8))) (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (= .cse4 0)) (.cse2 (= .cse10 0))) (let ((.cse1 (and .cse7 .cse2)) (.cse0 (select .cse6 16))) (and (or (< .cse0 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse0) 18446744073709551616)))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963968)) .cse1) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse2) .cse1) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse3 24) 0) (or (= .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (not (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse0) (= (select .cse5 24) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (or .cse7 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 8))) (let ((.cse8 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|)) (.cse11 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|) .cse9))) (and (= (select .cse8 .cse9) .cse10) (= .cse11 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse8 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 24)) 0) (= .cse4 .cse11)))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))))) [2023-11-23 08:16:02,962 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse9 (select .cse4 8)) (.cse11 (select .cse3 8))) (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (= .cse11 0)) (.cse2 (= .cse9 0))) (let ((.cse1 (and .cse6 .cse2)) (.cse0 (select .cse5 16))) (and (or (< .cse0 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse0) 18446744073709551616)))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963968)) .cse1) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse2) .cse1) (= (select .cse3 24) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse0) (= (select .cse4 24) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1218#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse5 0) 0) (or .cse6 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 8))) (let ((.cse7 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|)) (.cse10 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|) .cse8))) (and (= (select .cse7 .cse8) .cse9) (= .cse10 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse7 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 24)) 0) (= .cse11 .cse10)))))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))))) [2023-11-23 08:16:02,962 INFO L899 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2023-11-23 08:16:02,962 INFO L895 garLoopResultBuilder]: At program point L8966(line 8966) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse9 (select .cse4 8)) (.cse11 (select .cse3 8))) (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (= .cse11 0)) (.cse2 (= .cse9 0))) (let ((.cse1 (and .cse6 .cse2)) (.cse0 (select .cse5 16))) (and (or (< .cse0 (+ 18446744073709551616 (* 18446744073709551616 (div (+ (- 36028797018963968) .cse0) 18446744073709551616)))) (< .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963968)) .cse1) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse2) .cse1) (= (select .cse3 24) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse0) (= (select .cse4 24) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse5 0) 0) (or .cse6 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 8))) (let ((.cse7 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|)) (.cse10 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_13|) .cse8))) (and (= (select .cse7 .cse8) .cse9) (= .cse10 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse7 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_13| 24)) 0) (= .cse11 .cse10)))))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))))) [2023-11-23 08:16:02,962 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2023-11-23 08:16:02,962 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 08:16:02,962 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 08:16:02,963 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 08:16:02,963 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 08:16:02,963 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 08:16:02,963 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 08:16:02,965 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:16:02,968 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 08:16:02,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:16:02 BoogieIcfgContainer [2023-11-23 08:16:02,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 08:16:02,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 08:16:02,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 08:16:02,972 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 08:16:02,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:14:28" (3/4) ... [2023-11-23 08:16:02,974 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 08:16:02,978 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-23 08:16:02,978 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-23 08:16:02,978 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2023-11-23 08:16:02,978 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 08:16:02,978 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 08:16:02,990 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2023-11-23 08:16:02,991 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2023-11-23 08:16:02,992 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-23 08:16:02,993 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-23 08:16:02,994 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 08:16:02,995 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 08:16:02,996 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-23 08:16:02,997 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 08:16:03,447 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 08:16:03,449 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 08:16:03,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 08:16:03,449 INFO L158 Benchmark]: Toolchain (without parser) took 99478.41ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 123.1MB in the beginning and 713.7MB in the end (delta: -590.6MB). Peak memory consumption was 293.9MB. Max. memory is 16.1GB. [2023-11-23 08:16:03,450 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:16:03,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2470.10ms. Allocated memory is still 155.2MB. Free memory was 122.6MB in the beginning and 68.2MB in the end (delta: 54.4MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. [2023-11-23 08:16:03,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 184.56ms. Allocated memory is still 155.2MB. Free memory was 68.2MB in the beginning and 57.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-23 08:16:03,452 INFO L158 Benchmark]: Boogie Preprocessor took 110.42ms. Allocated memory is still 155.2MB. Free memory was 57.2MB in the beginning and 50.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 08:16:03,452 INFO L158 Benchmark]: RCFGBuilder took 1404.72ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 50.9MB in the beginning and 129.4MB in the end (delta: -78.6MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2023-11-23 08:16:03,452 INFO L158 Benchmark]: TraceAbstraction took 94825.02ms. Allocated memory was 245.4MB in the beginning and 1.0GB in the end (delta: 796.9MB). Free memory was 128.4MB in the beginning and 844.7MB in the end (delta: -716.4MB). Peak memory consumption was 568.2MB. Max. memory is 16.1GB. [2023-11-23 08:16:03,453 INFO L158 Benchmark]: Witness Printer took 477.18ms. Allocated memory is still 1.0GB. Free memory was 844.7MB in the beginning and 713.7MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2023-11-23 08:16:03,462 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.27ms. Allocated memory is still 104.9MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2470.10ms. Allocated memory is still 155.2MB. Free memory was 122.6MB in the beginning and 68.2MB in the end (delta: 54.4MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 184.56ms. Allocated memory is still 155.2MB. Free memory was 68.2MB in the beginning and 57.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.42ms. Allocated memory is still 155.2MB. Free memory was 57.2MB in the beginning and 50.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1404.72ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 50.9MB in the beginning and 129.4MB in the end (delta: -78.6MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * TraceAbstraction took 94825.02ms. Allocated memory was 245.4MB in the beginning and 1.0GB in the end (delta: 796.9MB). Free memory was 128.4MB in the beginning and 844.7MB in the end (delta: -716.4MB). Peak memory consumption was 568.2MB. Max. memory is 16.1GB. * Witness Printer took 477.18ms. Allocated memory is still 1.0GB. Free memory was 844.7MB in the beginning and 713.7MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8269]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] - GenericResultAtLocation [Line: 8755]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] * 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 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 94.8s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2098 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1987 mSDsluCounter, 3282 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2514 mSDsCounter, 511 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10617 IncrementalHoareTripleChecker+Invalid, 11128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 511 mSolverCounterUnsat, 768 mSDtfsCounter, 10617 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 866 GetRequests, 488 SyntacticMatches, 13 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=19, InterpolantAutomatonStates: 255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 196 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 197 PreInvPairs, 219 NumberOfFragments, 2323 HoareAnnotationTreeSize, 197 FomulaSimplifications, 1769 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 19 FomulaSimplificationsInter, 3022 FormulaSimplificationTreeSizeReductionInter, 20.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 52.0s InterpolantComputationTime, 1342 NumberOfCodeBlocks, 1342 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1316 ConstructedInterpolants, 82 QuantifiedInterpolants, 10921 SizeOfPredicates, 36 NumberOfNonLiveVariables, 5008 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 562/604 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 08:16:03,510 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