./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_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 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:07:30,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:07:30,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:07:30,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:07:30,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:07:30,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:07:30,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:07:30,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:07:30,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:07:30,152 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:07:30,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:07:30,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:07:30,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:07:30,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:07:30,156 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:07:30,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:07:30,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:07:30,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:07:30,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:07:30,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:07:30,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:07:30,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:07:30,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:07:30,159 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:07:30,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:07:30,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:07:30,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:07:30,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:07:30,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:07:30,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:07:30,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:07:30,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:07:30,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:07:30,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:07:30,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:07:30,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:07:30,162 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:07:30,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:07:30,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:07:30,163 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 -> 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:07:30,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:07:30,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:07:30,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:07:30,403 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:07:30,416 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:07:30,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i [2023-11-23 07:07:31,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:07:32,075 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:07:32,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i [2023-11-23 07:07:32,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2398cc04d/62ccef0fd5da469496bba6a0e36b7799/FLAG585ea5c91 [2023-11-23 07:07:32,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2398cc04d/62ccef0fd5da469496bba6a0e36b7799 [2023-11-23 07:07:32,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:07:32,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:07:32,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:07:32,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:07:32,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:07:32,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:07:32" (1/1) ... [2023-11-23 07:07:32,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc59047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:32, skipping insertion in model container [2023-11-23 07:07:32,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:07:32" (1/1) ... [2023-11-23 07:07:32,224 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:07:32,420 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_cursor_from_array_harness.i[4500,4513] [2023-11-23 07:07:32,428 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_cursor_from_array_harness.i[4560,4573] [2023-11-23 07:07:33,003 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,003 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,004 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,004 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,005 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,011 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,019 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,022 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,023 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,232 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:07:33,233 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:07:33,235 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:07:33,237 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:07:33,239 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:07:33,242 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:07:33,242 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:07:33,243 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:07:33,244 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:07:33,247 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:07:33,438 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,438 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:07:33,541 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:07:33,557 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_cursor_from_array_harness.i[4500,4513] [2023-11-23 07:07:33,557 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_cursor_from_array_harness.i[4560,4573] [2023-11-23 07:07:33,619 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,623 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,623 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,624 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,625 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,632 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,632 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,633 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,633 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,664 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:07:33,665 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:07:33,666 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:07:33,666 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:07:33,666 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:07:33,667 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:07:33,667 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:07:33,670 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:07:33,670 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:07:33,670 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:07:33,746 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-23 07:07:33,747 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,748 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:07:33,756 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-23 07:07:33,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:07:33,934 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,934 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,935 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,935 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,935 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,935 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,935 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,935 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,936 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,936 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,936 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,936 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,936 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,937 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,937 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,937 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,937 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,937 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:07:33,943 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:07:33,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33 WrapperNode [2023-11-23 07:07:33,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:07:33,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:07:33,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:07:33,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:07:33,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,085 INFO L138 Inliner]: procedures = 689, calls = 2612, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 776 [2023-11-23 07:07:34,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:07:34,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:07:34,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:07:34,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:07:34,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,153 INFO L188 MemorySlicer]: Split 519 memory accesses to 6 slices as follows [2, 5, 256, 238, 15, 3]. 49 percent of accesses are in the largest equivalence class. The 504 initializations are split as follows [2, 5, 256, 236, 2, 3]. The 2 writes are split as follows [0, 0, 0, 0, 2, 0]. [2023-11-23 07:07:34,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:07:34,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:07:34,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:07:34,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:07:34,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (1/1) ... [2023-11-23 07:07:34,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:07:34,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:07:34,265 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 07:07:34,295 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 07:07:34,352 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-23 07:07:34,353 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-23 07:07:34,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:07:34,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 07:07:34,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 07:07:34,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 07:07:34,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 07:07:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 07:07:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 07:07:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:07:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:07:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:07:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:07:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:07:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:07:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:07:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 07:07:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-23 07:07:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-23 07:07:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:07:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:07:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 07:07:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 07:07:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:07:34,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:07:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:07:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:07:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:07:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:07:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 07:07:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-23 07:07:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-23 07:07:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:07:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:07:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:07:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 07:07:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-23 07:07:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-23 07:07:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:07:34,358 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:07:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 07:07:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 07:07:34,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 07:07:34,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 07:07:34,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 07:07:34,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 07:07:34,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:07:34,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:07:34,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:07:34,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 07:07:34,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 07:07:34,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 07:07:34,599 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:07:34,600 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:07:35,194 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:07:35,279 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:07:35,280 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 07:07:35,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:07:35 BoogieIcfgContainer [2023-11-23 07:07:35,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:07:35,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:07:35,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:07:35,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:07:35,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:07:32" (1/3) ... [2023-11-23 07:07:35,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3be116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:07:35, skipping insertion in model container [2023-11-23 07:07:35,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:07:33" (2/3) ... [2023-11-23 07:07:35,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3be116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:07:35, skipping insertion in model container [2023-11-23 07:07:35,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:07:35" (3/3) ... [2023-11-23 07:07:35,289 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2023-11-23 07:07:35,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:07:35,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:07:35,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:07:35,351 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;@6743059b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:07:35,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:07:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 07:07:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 07:07:35,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:35,363 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 07:07:35,365 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:35,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash -907799074, now seen corresponding path program 1 times [2023-11-23 07:07:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402302433] [2023-11-23 07:07:35,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:35,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:36,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:36,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:36,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:36,221 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 07:07:36,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:36,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402302433] [2023-11-23 07:07:36,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402302433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:36,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:36,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:07:36,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337092459] [2023-11-23 07:07:36,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:36,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:07:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:36,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:07:36,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:07:36,247 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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 07:07:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:36,445 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2023-11-23 07:07:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:07:36,447 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 07:07:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:36,452 INFO L225 Difference]: With dead ends: 104 [2023-11-23 07:07:36,453 INFO L226 Difference]: Without dead ends: 51 [2023-11-23 07:07:36,455 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 07:07:36,457 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 39 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:36,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 94 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:07:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-23 07:07:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-23 07:07:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 07:07:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-11-23 07:07:36,483 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 26 [2023-11-23 07:07:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:36,484 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-11-23 07:07:36,484 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 07:07:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-11-23 07:07:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 07:07:36,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:36,485 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] [2023-11-23 07:07:36,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:07:36,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:36,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1591451111, now seen corresponding path program 1 times [2023-11-23 07:07:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813334434] [2023-11-23 07:07:36,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:37,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:37,185 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 07:07:37,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813334434] [2023-11-23 07:07:37,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813334434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:37,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:37,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 07:07:37,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375271490] [2023-11-23 07:07:37,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:37,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:07:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:07:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:07:37,188 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 07:07:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:37,431 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2023-11-23 07:07:37,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:07:37,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 28 [2023-11-23 07:07:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:37,432 INFO L225 Difference]: With dead ends: 62 [2023-11-23 07:07:37,432 INFO L226 Difference]: Without dead ends: 60 [2023-11-23 07:07:37,433 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 07:07:37,434 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:37,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 164 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:07:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-23 07:07:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-11-23 07:07:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 07:07:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2023-11-23 07:07:37,441 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 28 [2023-11-23 07:07:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:37,441 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2023-11-23 07:07:37,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 07:07:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2023-11-23 07:07:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 07:07:37,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:37,443 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 07:07:37,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 07:07:37,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:37,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash 400242259, now seen corresponding path program 1 times [2023-11-23 07:07:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117115550] [2023-11-23 07:07:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:37,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:37,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:37,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:38,060 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 07:07:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117115550] [2023-11-23 07:07:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117115550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:38,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:38,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 07:07:38,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664771009] [2023-11-23 07:07:38,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:38,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 07:07:38,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:38,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 07:07:38,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:07:38,067 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 07:07:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:38,233 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2023-11-23 07:07:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:07:38,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 07:07:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:38,240 INFO L225 Difference]: With dead ends: 103 [2023-11-23 07:07:38,241 INFO L226 Difference]: Without dead ends: 59 [2023-11-23 07:07:38,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:07:38,244 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:38,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 79 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:07:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-23 07:07:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-23 07:07:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 07:07:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2023-11-23 07:07:38,257 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 32 [2023-11-23 07:07:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:38,257 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2023-11-23 07:07:38,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 07:07:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2023-11-23 07:07:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 07:07:38,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:38,259 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 07:07:38,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 07:07:38,259 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:38,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash -300822319, now seen corresponding path program 1 times [2023-11-23 07:07:38,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:38,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656395596] [2023-11-23 07:07:38,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:38,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:39,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:39,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:39,220 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 07:07:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656395596] [2023-11-23 07:07:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656395596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:39,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:39,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 07:07:39,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631497751] [2023-11-23 07:07:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:39,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:07:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:39,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:07:39,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:07:39,223 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 07:07:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:39,537 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2023-11-23 07:07:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:07:39,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 32 [2023-11-23 07:07:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:39,539 INFO L225 Difference]: With dead ends: 107 [2023-11-23 07:07:39,539 INFO L226 Difference]: Without dead ends: 63 [2023-11-23 07:07:39,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:07:39,540 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 50 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:39,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 172 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:07:39,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-23 07:07:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2023-11-23 07:07:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 07:07:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2023-11-23 07:07:39,545 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 32 [2023-11-23 07:07:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:39,545 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2023-11-23 07:07:39,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 07:07:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2023-11-23 07:07:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 07:07:39,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:39,546 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] [2023-11-23 07:07:39,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 07:07:39,547 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:39,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:39,547 INFO L85 PathProgramCache]: Analyzing trace with hash -836842836, now seen corresponding path program 1 times [2023-11-23 07:07:39,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:39,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722982523] [2023-11-23 07:07:39,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:39,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:40,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:40,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:40,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:40,088 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 07:07:40,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:40,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722982523] [2023-11-23 07:07:40,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722982523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:40,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:40,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 07:07:40,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518909455] [2023-11-23 07:07:40,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:40,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:07:40,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:40,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:07:40,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:07:40,090 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 07:07:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:40,362 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2023-11-23 07:07:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:07:40,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 34 [2023-11-23 07:07:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:40,363 INFO L225 Difference]: With dead ends: 74 [2023-11-23 07:07:40,363 INFO L226 Difference]: Without dead ends: 72 [2023-11-23 07:07:40,363 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 07:07:40,364 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:40,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 208 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:07:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-23 07:07:40,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2023-11-23 07:07:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 07:07:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2023-11-23 07:07:40,369 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 34 [2023-11-23 07:07:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:40,369 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2023-11-23 07:07:40,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 07:07:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2023-11-23 07:07:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 07:07:40,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:40,371 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] [2023-11-23 07:07:40,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 07:07:40,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:40,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1229869846, now seen corresponding path program 1 times [2023-11-23 07:07:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:40,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343580886] [2023-11-23 07:07:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:40,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,187 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 07:07:41,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:41,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343580886] [2023-11-23 07:07:41,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343580886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:41,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:41,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 07:07:41,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382991002] [2023-11-23 07:07:41,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:41,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 07:07:41,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:41,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 07:07:41,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:07:41,190 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 07:07:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:41,603 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-11-23 07:07:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 07:07:41,603 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 34 [2023-11-23 07:07:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:41,604 INFO L225 Difference]: With dead ends: 73 [2023-11-23 07:07:41,604 INFO L226 Difference]: Without dead ends: 71 [2023-11-23 07:07:41,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-11-23 07:07:41,605 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 68 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:41,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 248 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:07:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-23 07:07:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2023-11-23 07:07:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 07:07:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2023-11-23 07:07:41,609 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 34 [2023-11-23 07:07:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:41,609 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2023-11-23 07:07:41,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 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 07:07:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2023-11-23 07:07:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-23 07:07:41,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:41,610 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] [2023-11-23 07:07:41,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 07:07:41,611 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:41,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:41,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1545992480, now seen corresponding path program 1 times [2023-11-23 07:07:41,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:41,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75688689] [2023-11-23 07:07:41,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:41,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 07:07:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:07:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:41,879 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 07:07:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:41,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75688689] [2023-11-23 07:07:41,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75688689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:41,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:07:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575744421] [2023-11-23 07:07:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:41,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:07:41,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:41,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:07:41,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:07:41,881 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 07:07:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:42,012 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2023-11-23 07:07:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:07:42,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 39 [2023-11-23 07:07:42,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:42,014 INFO L225 Difference]: With dead ends: 83 [2023-11-23 07:07:42,014 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 07:07:42,014 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 07:07:42,015 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 43 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:42,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 63 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:07:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 07:07:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 07:07:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 07:07:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-11-23 07:07:42,019 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 39 [2023-11-23 07:07:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:42,019 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-11-23 07:07:42,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 07:07:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-11-23 07:07:42,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-23 07:07:42,020 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:42,020 INFO L195 NwaCegarLoop]: trace histogram [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 07:07:42,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 07:07:42,020 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:42,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash -800564005, now seen corresponding path program 1 times [2023-11-23 07:07:42,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107487905] [2023-11-23 07:07:42,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:42,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:42,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:42,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:42,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:42,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:42,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 07:07:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:42,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:07:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 07:07:42,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107487905] [2023-11-23 07:07:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107487905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:42,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:42,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 07:07:42,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673630853] [2023-11-23 07:07:42,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:42,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:07:42,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:07:42,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:07:42,459 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 07:07:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:42,695 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2023-11-23 07:07:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:07:42,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 41 [2023-11-23 07:07:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:42,698 INFO L225 Difference]: With dead ends: 68 [2023-11-23 07:07:42,698 INFO L226 Difference]: Without dead ends: 66 [2023-11-23 07:07:42,699 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 07:07:42,699 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:42,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 163 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:07:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-23 07:07:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2023-11-23 07:07:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 45 states have internal predecessors, (46), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 07:07:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2023-11-23 07:07:42,704 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 41 [2023-11-23 07:07:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:42,704 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2023-11-23 07:07:42,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 07:07:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2023-11-23 07:07:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-23 07:07:42,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:42,705 INFO L195 NwaCegarLoop]: trace histogram [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 07:07:42,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 07:07:42,705 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:42,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1325770093, now seen corresponding path program 1 times [2023-11-23 07:07:42,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:42,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435372632] [2023-11-23 07:07:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:42,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:43,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:43,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:43,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:43,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 07:07:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:43,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:07:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 07:07:43,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:43,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435372632] [2023-11-23 07:07:43,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435372632] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:07:43,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547492015] [2023-11-23 07:07:43,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:43,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:07:43,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:07:43,917 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 07:07:43,932 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 07:07:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:44,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 2412 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-23 07:07:44,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:07:44,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 07:07:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 07:07:45,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:07:45,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547492015] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:07:45,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:07:45,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2023-11-23 07:07:45,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527160574] [2023-11-23 07:07:45,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:07:45,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-23 07:07:45,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:45,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-23 07:07:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2023-11-23 07:07:45,318 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-23 07:07:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:46,327 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2023-11-23 07:07:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 07:07:46,328 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 45 [2023-11-23 07:07:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:46,328 INFO L225 Difference]: With dead ends: 138 [2023-11-23 07:07:46,328 INFO L226 Difference]: Without dead ends: 101 [2023-11-23 07:07:46,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2023-11-23 07:07:46,329 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 102 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:46,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 148 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 07:07:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-23 07:07:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2023-11-23 07:07:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.078125) internal successors, (69), 67 states have internal predecessors, (69), 20 states have call successors, (20), 12 states have call predecessors, (20), 14 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2023-11-23 07:07:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2023-11-23 07:07:46,337 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 45 [2023-11-23 07:07:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:46,337 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2023-11-23 07:07:46,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-23 07:07:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2023-11-23 07:07:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-23 07:07:46,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:46,339 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:07:46,371 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 07:07:46,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:07:46,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:46,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash -335679087, now seen corresponding path program 1 times [2023-11-23 07:07:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396333299] [2023-11-23 07:07:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:47,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:47,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:47,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 07:07:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:07:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:47,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:07:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 07:07:47,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:47,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396333299] [2023-11-23 07:07:47,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396333299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:47,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:47,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 07:07:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761148058] [2023-11-23 07:07:47,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:47,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 07:07:47,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:47,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 07:07:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:07:47,782 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-23 07:07:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:48,099 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-11-23 07:07:48,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 07:07:48,100 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2023-11-23 07:07:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:48,101 INFO L225 Difference]: With dead ends: 109 [2023-11-23 07:07:48,101 INFO L226 Difference]: Without dead ends: 107 [2023-11-23 07:07:48,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2023-11-23 07:07:48,101 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 73 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:48,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 134 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:07:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-23 07:07:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-23 07:07:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 73 states have internal predecessors, (75), 20 states have call successors, (20), 14 states have call predecessors, (20), 16 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2023-11-23 07:07:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2023-11-23 07:07:48,113 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 47 [2023-11-23 07:07:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:48,113 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2023-11-23 07:07:48,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-23 07:07:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2023-11-23 07:07:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 07:07:48,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:48,114 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] [2023-11-23 07:07:48,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 07:07:48,114 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:48,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:48,115 INFO L85 PathProgramCache]: Analyzing trace with hash -85865888, now seen corresponding path program 1 times [2023-11-23 07:07:48,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:48,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984380912] [2023-11-23 07:07:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:48,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:48,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:07:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:48,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 07:07:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 07:07:48,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:48,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984380912] [2023-11-23 07:07:48,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984380912] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:07:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913694052] [2023-11-23 07:07:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:48,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:07:48,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:07:48,977 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 07:07:49,016 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 07:07:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:49,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 2429 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:07:49,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:07:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 07:07:49,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:07:49,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913694052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:49,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:07:49,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2023-11-23 07:07:49,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869523815] [2023-11-23 07:07:49,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:49,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 07:07:49,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:49,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 07:07:49,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:07:49,454 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 07:07:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:49,601 INFO L93 Difference]: Finished difference Result 191 states and 207 transitions. [2023-11-23 07:07:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:07:49,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2023-11-23 07:07:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:49,603 INFO L225 Difference]: With dead ends: 191 [2023-11-23 07:07:49,603 INFO L226 Difference]: Without dead ends: 107 [2023-11-23 07:07:49,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:07:49,605 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:49,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 178 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:07:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-23 07:07:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-23 07:07:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 73 states have internal predecessors, (74), 20 states have call successors, (20), 14 states have call predecessors, (20), 16 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2023-11-23 07:07:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2023-11-23 07:07:49,619 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 51 [2023-11-23 07:07:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:49,619 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2023-11-23 07:07:49,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 07:07:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2023-11-23 07:07:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 07:07:49,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:49,620 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] [2023-11-23 07:07:49,639 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 07:07:49,836 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,SelfDestructingSolverStorable10 [2023-11-23 07:07:49,836 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:49,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:49,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1837362146, now seen corresponding path program 1 times [2023-11-23 07:07:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:49,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64644776] [2023-11-23 07:07:49,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:50,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:50,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:07:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 07:07:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:50,771 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 07:07:50,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:50,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64644776] [2023-11-23 07:07:50,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64644776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:50,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:50,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 07:07:50,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623665236] [2023-11-23 07:07:50,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:50,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:07:50,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:50,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:07:50,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:07:50,773 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 07:07:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:51,130 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2023-11-23 07:07:51,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:07:51,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 51 [2023-11-23 07:07:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:51,132 INFO L225 Difference]: With dead ends: 135 [2023-11-23 07:07:51,132 INFO L226 Difference]: Without dead ends: 103 [2023-11-23 07:07:51,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:07:51,133 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:51,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 122 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:07:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-23 07:07:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-23 07:07:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.044776119402985) internal successors, (70), 69 states have internal predecessors, (70), 20 states have call successors, (20), 14 states have call predecessors, (20), 15 states have return successors, (20), 19 states have call predecessors, (20), 18 states have call successors, (20) [2023-11-23 07:07:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2023-11-23 07:07:51,145 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 51 [2023-11-23 07:07:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:51,146 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2023-11-23 07:07:51,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 07:07:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2023-11-23 07:07:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-23 07:07:51,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:51,147 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:07:51,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 07:07:51,147 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:51,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:51,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1158650191, now seen corresponding path program 1 times [2023-11-23 07:07:51,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:51,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422758110] [2023-11-23 07:07:51,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:51,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:52,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:52,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 07:07:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:07:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:07:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:07:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-23 07:07:52,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:52,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422758110] [2023-11-23 07:07:52,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422758110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 07:07:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362596436] [2023-11-23 07:07:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:52,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:07:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:52,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:07:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:07:52,183 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:07:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:52,491 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2023-11-23 07:07:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:07:52,493 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2023-11-23 07:07:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:52,493 INFO L225 Difference]: With dead ends: 113 [2023-11-23 07:07:52,493 INFO L226 Difference]: Without dead ends: 109 [2023-11-23 07:07:52,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:07:52,494 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:52,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 125 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:07:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-23 07:07:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-23 07:07:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 73 states have internal predecessors, (74), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (20), 19 states have call predecessors, (20), 18 states have call successors, (20) [2023-11-23 07:07:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2023-11-23 07:07:52,503 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 54 [2023-11-23 07:07:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:52,504 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2023-11-23 07:07:52,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:07:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2023-11-23 07:07:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 07:07:52,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:52,505 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 07:07:52,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 07:07:52,505 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:52,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:52,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1205282747, now seen corresponding path program 1 times [2023-11-23 07:07:52,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:52,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969485097] [2023-11-23 07:07:52,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:52,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:53,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:53,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:53,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:07:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:53,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 07:07:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 07:07:53,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969485097] [2023-11-23 07:07:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969485097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:53,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:53,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 07:07:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883273480] [2023-11-23 07:07:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:53,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 07:07:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 07:07:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:07:53,321 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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 07:07:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:53,698 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2023-11-23 07:07:53,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 07:07:53,698 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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 53 [2023-11-23 07:07:53,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:53,699 INFO L225 Difference]: With dead ends: 115 [2023-11-23 07:07:53,699 INFO L226 Difference]: Without dead ends: 111 [2023-11-23 07:07:53,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2023-11-23 07:07:53,700 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:53,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 266 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:07:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-23 07:07:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2023-11-23 07:07:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 72 states have internal predecessors, (72), 19 states have call successors, (19), 16 states have call predecessors, (19), 16 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2023-11-23 07:07:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2023-11-23 07:07:53,711 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 53 [2023-11-23 07:07:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:53,711 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2023-11-23 07:07:53,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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 07:07:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2023-11-23 07:07:53,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:07:53,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:53,712 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:07:53,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 07:07:53,712 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:53,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:53,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2058389405, now seen corresponding path program 1 times [2023-11-23 07:07:53,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:53,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662112108] [2023-11-23 07:07:53,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:53,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 07:07:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:07:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:07:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:07:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:07:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:07:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:07:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-23 07:07:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:54,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662112108] [2023-11-23 07:07:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662112108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:54,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:54,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 07:07:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832800488] [2023-11-23 07:07:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:54,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:07:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:54,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:07:54,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:07:54,735 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-23 07:07:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:54,957 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2023-11-23 07:07:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:07:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 70 [2023-11-23 07:07:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:54,958 INFO L225 Difference]: With dead ends: 113 [2023-11-23 07:07:54,958 INFO L226 Difference]: Without dead ends: 63 [2023-11-23 07:07:54,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:07:54,959 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 52 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:54,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 117 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:07:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-23 07:07:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-23 07:07:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0) internal successors, (42), 42 states have internal predecessors, (42), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 07:07:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2023-11-23 07:07:54,963 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 70 [2023-11-23 07:07:54,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:54,963 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2023-11-23 07:07:54,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-23 07:07:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2023-11-23 07:07:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 07:07:54,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:07:54,963 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:07:54,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 07:07:54,964 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:07:54,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:07:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1818503357, now seen corresponding path program 1 times [2023-11-23 07:07:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:07:54,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200535066] [2023-11-23 07:07:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:07:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:07:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:07:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 07:07:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:07:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:07:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 07:07:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:07:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:07:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:07:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 07:07:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 07:07:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:07:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-23 07:07:56,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:07:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200535066] [2023-11-23 07:07:56,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200535066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:07:56,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:07:56,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 07:07:56,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602918341] [2023-11-23 07:07:56,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:07:56,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:07:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:07:56,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:07:56,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:07:56,800 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 07:07:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:07:57,131 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2023-11-23 07:07:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 07:07:57,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 82 [2023-11-23 07:07:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:07:57,131 INFO L225 Difference]: With dead ends: 63 [2023-11-23 07:07:57,131 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 07:07:57,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:07:57,133 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:07:57,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 134 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:07:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 07:07:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 07:07:57,134 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 07:07:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 07:07:57,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2023-11-23 07:07:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:07:57,135 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 07:07:57,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 07:07:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 07:07:57,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 07:07:57,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 07:07:57,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 07:07:57,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 07:07:57,696 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7384 7388) the Hoare annotation is: true [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7384 7388) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 07:07:57,697 INFO L899 garLoopResultBuilder]: For program point L8256-2(line 8256) no Hoare annotation was computed. [2023-11-23 07:07:57,698 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 07:07:57,698 INFO L895 garLoopResultBuilder]: At program point L8256-1(line 8256) the Hoare annotation is: (let ((.cse6 (select (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 0)) (.cse13 (select (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (not (= .cse13 0))) (.cse2 (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8) 0)) (.cse3 (= .cse13 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1| 1)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0)) (.cse7 (= .cse6 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse8 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|))) (.cse9 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 (+ .cse6 (* 18446744073709551616 (div (* (- 1) .cse6) 18446744073709551616)))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2023-11-23 07:07:57,698 INFO L895 garLoopResultBuilder]: At program point L8256(line 8256) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= .cse0 0)) (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8) 0) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0) (= (select (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) [2023-11-23 07:07:57,698 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2023-11-23 07:07:57,698 INFO L899 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2023-11-23 07:07:57,698 INFO L899 garLoopResultBuilder]: For program point L8252-1(line 8252) no Hoare annotation was computed. [2023-11-23 07:07:57,698 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2023-11-23 07:07:57,698 INFO L895 garLoopResultBuilder]: At program point L8252(line 8252) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) [2023-11-23 07:07:57,699 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (let ((.cse0 (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (= .cse10 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (not (= .cse10 0))) (.cse6 (= (select (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0)) (.cse7 (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) .cse6 .cse7) (let ((.cse8 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (.cse9 (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (and .cse0 (or (not .cse7) (and .cse1 .cse8) (not .cse9)) .cse2 .cse3 (<= |ULTIMATE.start_assert_bytes_match_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616))) .cse4 .cse5 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) .cse6 (or (not .cse1) (not .cse8) (and .cse9 .cse7))))))) [2023-11-23 07:07:57,699 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 07:07:57,700 INFO L895 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (let ((.cse0 (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1217#1|)) (.cse3 (= .cse7 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (not (= .cse7 0))) (.cse6 (= (select (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) .cse6)))) [2023-11-23 07:07:57,700 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2023-11-23 07:07:57,700 INFO L899 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2023-11-23 07:07:57,700 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (and (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (not (= .cse0 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2023-11-23 07:07:57,700 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2023-11-23 07:07:57,700 INFO L899 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2023-11-23 07:07:57,700 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_#t~mem594#1| |ULTIMATE.start_assert_bytes_match_#t~mem593#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| (select .cse0 .cse1)) (not (= (select .cse0 8) 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (= (select (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2023-11-23 07:07:57,700 INFO L902 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2023-11-23 07:07:57,700 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (and (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (not (= .cse0 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2023-11-23 07:07:57,701 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0)) (.cse8 (select (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (let ((.cse0 (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0)) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse4 (= .cse8 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse6 (not (= .cse8 0))) (.cse7 (= .cse2 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and .cse0 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12| Int)) (let ((.cse1 (select (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_12|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_12|))) (and (<= 0 (+ .cse1 (* (div (* (- 1) .cse1) 18446744073709551616) 18446744073709551616))) (= .cse2 .cse1)))) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 .cse5 .cse6 .cse7)))) [2023-11-23 07:07:57,703 INFO L899 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2023-11-23 07:07:57,704 INFO L895 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (let ((.cse0 (= (select (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1216#1| 1)) (.cse3 (= .cse7 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (not (= .cse7 0))) (.cse6 (= (select (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) .cse6) (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2023-11-23 07:07:57,704 INFO L899 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2023-11-23 07:07:57,704 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2023-11-23 07:07:57,704 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 07:07:57,705 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 07:07:57,705 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 07:07:57,705 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 07:07:57,705 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 07:07:57,705 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 07:07:57,707 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:07:57,709 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 07:07:57,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:07:57 BoogieIcfgContainer [2023-11-23 07:07:57,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 07:07:57,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 07:07:57,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 07:07:57,715 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 07:07:57,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:07:35" (3/4) ... [2023-11-23 07:07:57,717 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 07:07:57,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-23 07:07:57,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2023-11-23 07:07:57,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-23 07:07:57,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 07:07:57,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 07:07:57,735 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2023-11-23 07:07:57,736 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2023-11-23 07:07:57,737 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-23 07:07:57,738 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-23 07:07:57,738 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 07:07:57,739 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 07:07:57,739 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-23 07:07:57,740 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 07:07:58,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 07:07:58,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 07:07:58,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 07:07:58,173 INFO L158 Benchmark]: Toolchain (without parser) took 26042.90ms. Allocated memory was 163.6MB in the beginning and 1.1GB in the end (delta: 975.2MB). Free memory was 131.8MB in the beginning and 820.5MB in the end (delta: -688.7MB). Peak memory consumption was 285.2MB. Max. memory is 16.1GB. [2023-11-23 07:07:58,173 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 44.5MB in the beginning and 44.5MB in the end (delta: 56.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 07:07:58,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1810.97ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 82.3MB in the end (delta: 49.6MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. [2023-11-23 07:07:58,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.37ms. Allocated memory is still 163.6MB. Free memory was 82.3MB in the beginning and 70.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 07:07:58,174 INFO L158 Benchmark]: Boogie Preprocessor took 126.47ms. Allocated memory is still 163.6MB. Free memory was 70.6MB in the beginning and 56.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-23 07:07:58,174 INFO L158 Benchmark]: RCFGBuilder took 1065.69ms. Allocated memory was 163.6MB in the beginning and 291.5MB in the end (delta: 127.9MB). Free memory was 56.0MB in the beginning and 191.7MB in the end (delta: -135.7MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2023-11-23 07:07:58,174 INFO L158 Benchmark]: TraceAbstraction took 22431.64ms. Allocated memory was 291.5MB in the beginning and 1.1GB in the end (delta: 847.2MB). Free memory was 190.6MB in the beginning and 956.8MB in the end (delta: -766.2MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2023-11-23 07:07:58,175 INFO L158 Benchmark]: Witness Printer took 458.00ms. Allocated memory is still 1.1GB. Free memory was 955.8MB in the beginning and 820.5MB in the end (delta: 135.3MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2023-11-23 07:07:58,176 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.15ms. Allocated memory is still 96.5MB. Free memory was 44.5MB in the beginning and 44.5MB in the end (delta: 56.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1810.97ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 82.3MB in the end (delta: 49.6MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.37ms. Allocated memory is still 163.6MB. Free memory was 82.3MB in the beginning and 70.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.47ms. Allocated memory is still 163.6MB. Free memory was 70.6MB in the beginning and 56.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1065.69ms. Allocated memory was 163.6MB in the beginning and 291.5MB in the end (delta: 127.9MB). Free memory was 56.0MB in the beginning and 191.7MB in the end (delta: -135.7MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22431.64ms. Allocated memory was 291.5MB in the beginning and 1.1GB in the end (delta: 847.2MB). Free memory was 190.6MB in the beginning and 956.8MB in the end (delta: -766.2MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. * Witness Printer took 458.00ms. Allocated memory is still 1.1GB. Free memory was 955.8MB in the beginning and 820.5MB in the end (delta: 135.3MB). Peak memory consumption was 132.1MB. 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, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.4s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 777 mSDsluCounter, 2415 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1946 mSDsCounter, 251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5330 IncrementalHoareTripleChecker+Invalid, 5581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 251 mSolverCounterUnsat, 469 mSDtfsCounter, 5330 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 325 SyntacticMatches, 5 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=13, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 33 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 90 PreInvPairs, 105 NumberOfFragments, 813 HoareAnnotationTreeSize, 90 FomulaSimplifications, 231 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 500 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 797 ConstructedInterpolants, 16 QuantifiedInterpolants, 3424 SizeOfPredicates, 18 NumberOfNonLiveVariables, 4841 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 273/288 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 07:07:58,213 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