./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_empty_array_harness.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_empty_array_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 06:53:25,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 06:53:25,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 06:53:25,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 06:53:25,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 06:53:25,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 06:53:25,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 06:53:25,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 06:53:25,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 06:53:25,399 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 06:53:25,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 06:53:25,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 06:53:25,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 06:53:25,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 06:53:25,401 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 06:53:25,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 06:53:25,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 06:53:25,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 06:53:25,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 06:53:25,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 06:53:25,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 06:53:25,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 06:53:25,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 06:53:25,403 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 06:53:25,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 06:53:25,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 06:53:25,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 06:53:25,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 06:53:25,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 06:53:25,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 06:53:25,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 06:53:25,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 06:53:25,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 06:53:25,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 06:53:25,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 06:53:25,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 06:53:25,407 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 06:53:25,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 06:53:25,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 06:53:25,407 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 06:53:25,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 06:53:25,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 06:53:25,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 06:53:25,652 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 06:53:25,653 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 06:53:25,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2023-11-23 06:53:26,730 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 06:53:27,101 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 06:53:27,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2023-11-23 06:53:27,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53489c015/b9d677ffe0d64102a366187c4a54eea2/FLAG2a905e2de [2023-11-23 06:53:27,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53489c015/b9d677ffe0d64102a366187c4a54eea2 [2023-11-23 06:53:27,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 06:53:27,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 06:53:27,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 06:53:27,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 06:53:27,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 06:53:27,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:53:27" (1/1) ... [2023-11-23 06:53:27,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e98a814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:27, skipping insertion in model container [2023-11-23 06:53:27,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:53:27" (1/1) ... [2023-11-23 06:53:27,226 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 06:53:27,470 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2023-11-23 06:53:27,479 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2023-11-23 06:53:28,191 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,195 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,196 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,197 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,198 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,208 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,215 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,216 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,224 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,497 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 06:53:28,517 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 06:53:28,518 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 06:53:28,519 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 06:53:28,520 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 06:53:28,533 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 06:53:28,533 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 06:53:28,534 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 06:53:28,534 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 06:53:28,534 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 06:53:28,865 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,865 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:28,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 06:53:29,074 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 06:53:29,104 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2023-11-23 06:53:29,105 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2023-11-23 06:53:29,132 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,133 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,133 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,133 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,148 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,152 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,153 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,165 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,165 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,181 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 06:53:29,201 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 06:53:29,201 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 06:53:29,202 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 06:53:29,202 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 06:53:29,203 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 06:53:29,203 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 06:53:29,203 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 06:53:29,203 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 06:53:29,204 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 06:53:29,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-23 06:53:29,309 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,309 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 06:53:29,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-23 06:53:29,340 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 06:53:29,501 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,501 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,501 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,501 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,502 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,502 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,502 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,502 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,502 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,503 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,503 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,503 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,503 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,504 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,504 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,504 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,504 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,504 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 06:53:29,510 INFO L206 MainTranslator]: Completed translation [2023-11-23 06:53:29,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29 WrapperNode [2023-11-23 06:53:29,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 06:53:29,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 06:53:29,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 06:53:29,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 06:53:29,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,642 INFO L138 Inliner]: procedures = 689, calls = 2617, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 789 [2023-11-23 06:53:29,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 06:53:29,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 06:53:29,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 06:53:29,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 06:53:29,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,725 INFO L188 MemorySlicer]: Split 529 memory accesses to 6 slices as follows [2, 5, 256, 238, 25, 3]. 48 percent of accesses are in the largest equivalence class. The 506 initializations are split as follows [2, 5, 256, 236, 4, 3]. The 4 writes are split as follows [0, 0, 0, 0, 4, 0]. [2023-11-23 06:53:29,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 06:53:29,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 06:53:29,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 06:53:29,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 06:53:29,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (1/1) ... [2023-11-23 06:53:29,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 06:53:29,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:53:29,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 06:53:29,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 06:53:29,893 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2023-11-23 06:53:29,894 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2023-11-23 06:53:29,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 06:53:29,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 06:53:29,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 06:53:29,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 06:53:29,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 06:53:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 06:53:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 06:53:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 06:53:29,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 06:53:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 06:53:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 06:53:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 06:53:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 06:53:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 06:53:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 06:53:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-23 06:53:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-23 06:53:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 06:53:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 06:53:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 06:53:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 06:53:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 06:53:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 06:53:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 06:53:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 06:53:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 06:53:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 06:53:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 06:53:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-23 06:53:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-23 06:53:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 06:53:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 06:53:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 06:53:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 06:53:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-23 06:53:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-23 06:53:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 06:53:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 06:53:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 06:53:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 06:53:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 06:53:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 06:53:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 06:53:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 06:53:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 06:53:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 06:53:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 06:53:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 06:53:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 06:53:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 06:53:30,117 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 06:53:30,118 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 06:53:30,755 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 06:53:30,843 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 06:53:30,843 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 06:53:30,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:53:30 BoogieIcfgContainer [2023-11-23 06:53:30,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 06:53:30,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 06:53:30,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 06:53:30,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 06:53:30,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:53:27" (1/3) ... [2023-11-23 06:53:30,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6071cb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:53:30, skipping insertion in model container [2023-11-23 06:53:30,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:29" (2/3) ... [2023-11-23 06:53:30,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6071cb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:53:30, skipping insertion in model container [2023-11-23 06:53:30,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:53:30" (3/3) ... [2023-11-23 06:53:30,852 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2023-11-23 06:53:30,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 06:53:30,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 06:53:30,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 06:53:30,915 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;@352f3e6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 06:53:30,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 06:53:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-23 06:53:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 06:53:30,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:30,926 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 06:53:30,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:30,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1037058620, now seen corresponding path program 1 times [2023-11-23 06:53:30,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:30,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790625373] [2023-11-23 06:53:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:31,452 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 06:53:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790625373] [2023-11-23 06:53:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790625373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:31,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:31,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 06:53:31,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467940425] [2023-11-23 06:53:31,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:31,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 06:53:31,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:31,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 06:53:31,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 06:53:31,488 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:53:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:31,636 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2023-11-23 06:53:31,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 06:53:31,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2023-11-23 06:53:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:31,644 INFO L225 Difference]: With dead ends: 118 [2023-11-23 06:53:31,644 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 06:53:31,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 06:53:31,649 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:31,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 55 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 06:53:31,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 06:53:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 06:53:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 06:53:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2023-11-23 06:53:31,689 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 26 [2023-11-23 06:53:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:31,689 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2023-11-23 06:53:31,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:53:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2023-11-23 06:53:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 06:53:31,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:31,691 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 06:53:31,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 06:53:31,691 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:31,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash 872954432, now seen corresponding path program 1 times [2023-11-23 06:53:31,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:31,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131712397] [2023-11-23 06:53:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:31,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:32,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:32,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:32,189 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 06:53:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:32,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131712397] [2023-11-23 06:53:32,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131712397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:32,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:32,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 06:53:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090456727] [2023-11-23 06:53:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:32,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 06:53:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 06:53:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 06:53:32,193 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:53:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:32,395 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2023-11-23 06:53:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 06:53:32,395 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 06:53:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:32,397 INFO L225 Difference]: With dead ends: 106 [2023-11-23 06:53:32,397 INFO L226 Difference]: Without dead ends: 59 [2023-11-23 06:53:32,398 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 06:53:32,398 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 51 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:32,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 93 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-23 06:53:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-23 06:53:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 40 states have internal predecessors, (46), 14 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-23 06:53:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2023-11-23 06:53:32,406 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 26 [2023-11-23 06:53:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:32,406 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2023-11-23 06:53:32,407 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 06:53:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2023-11-23 06:53:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 06:53:32,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:32,408 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 06:53:32,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 06:53:32,408 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:32,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1950610027, now seen corresponding path program 1 times [2023-11-23 06:53:32,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:32,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323695164] [2023-11-23 06:53:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:32,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:32,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:32,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:32,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:33,004 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 06:53:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323695164] [2023-11-23 06:53:33,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323695164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:33,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:33,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 06:53:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509036951] [2023-11-23 06:53:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:33,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 06:53:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:33,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 06:53:33,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:53:33,007 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:53:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:33,272 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2023-11-23 06:53:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 06:53:33,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-11-23 06:53:33,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:33,273 INFO L225 Difference]: With dead ends: 70 [2023-11-23 06:53:33,274 INFO L226 Difference]: Without dead ends: 68 [2023-11-23 06:53:33,274 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 06:53:33,275 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:33,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 194 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-23 06:53:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2023-11-23 06:53:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 06:53:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2023-11-23 06:53:33,281 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 32 [2023-11-23 06:53:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:33,281 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2023-11-23 06:53:33,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:53:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2023-11-23 06:53:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 06:53:33,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:33,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:33,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 06:53:33,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:33,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1206889807, now seen corresponding path program 1 times [2023-11-23 06:53:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662863942] [2023-11-23 06:53:33,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 06:53:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662863942] [2023-11-23 06:53:36,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662863942] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:53:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722084957] [2023-11-23 06:53:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:36,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:53:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:53:36,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 06:53:36,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 06:53:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:36,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 2402 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-23 06:53:36,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:53:36,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2023-11-23 06:53:36,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 73 [2023-11-23 06:53:36,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 144 [2023-11-23 06:53:36,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 47 [2023-11-23 06:53:36,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2023-11-23 06:53:36,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 77 [2023-11-23 06:53:37,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 144 [2023-11-23 06:53:37,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 27 [2023-11-23 06:53:37,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 1 [2023-11-23 06:53:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 06:53:38,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 06:53:39,119 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 06:53:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722084957] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 06:53:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 06:53:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17, 15] total 31 [2023-11-23 06:53:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159655795] [2023-11-23 06:53:39,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:39,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 06:53:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:39,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 06:53:39,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2023-11-23 06:53:39,138 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 2 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 06:53:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:39,536 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2023-11-23 06:53:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 06:53:39,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-11-23 06:53:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:39,537 INFO L225 Difference]: With dead ends: 139 [2023-11-23 06:53:39,537 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 06:53:39,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2023-11-23 06:53:39,539 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 68 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:39,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 262 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:39,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 06:53:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2023-11-23 06:53:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 55 states have internal predecessors, (64), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 06:53:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2023-11-23 06:53:39,546 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 36 [2023-11-23 06:53:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:39,547 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2023-11-23 06:53:39,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 2 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 06:53:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2023-11-23 06:53:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 06:53:39,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:39,548 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:39,563 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 06:53:39,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:53:39,763 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:39,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash 505825229, now seen corresponding path program 1 times [2023-11-23 06:53:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:39,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573472478] [2023-11-23 06:53:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:40,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:40,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:40,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:40,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:40,509 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 06:53:40,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:40,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573472478] [2023-11-23 06:53:40,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573472478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:40,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:40,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 06:53:40,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977986953] [2023-11-23 06:53:40,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:40,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 06:53:40,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:40,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 06:53:40,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:53:40,512 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:53:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:40,803 INFO L93 Difference]: Finished difference Result 148 states and 187 transitions. [2023-11-23 06:53:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 06:53:40,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-11-23 06:53:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:40,805 INFO L225 Difference]: With dead ends: 148 [2023-11-23 06:53:40,805 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 06:53:40,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-11-23 06:53:40,808 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 61 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:40,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 148 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 06:53:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2023-11-23 06:53:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 57 states have internal predecessors, (67), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 06:53:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2023-11-23 06:53:40,823 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 36 [2023-11-23 06:53:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:40,825 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2023-11-23 06:53:40,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:53:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2023-11-23 06:53:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 06:53:40,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:40,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:40,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 06:53:40,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:40,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash 195772557, now seen corresponding path program 1 times [2023-11-23 06:53:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294013150] [2023-11-23 06:53:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:41,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:41,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:41,459 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 06:53:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294013150] [2023-11-23 06:53:41,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294013150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:41,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:41,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 06:53:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697420096] [2023-11-23 06:53:41,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:41,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 06:53:41,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 06:53:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:53:41,461 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:53:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:41,766 INFO L93 Difference]: Finished difference Result 187 states and 239 transitions. [2023-11-23 06:53:41,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 06:53:41,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-11-23 06:53:41,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:41,769 INFO L225 Difference]: With dead ends: 187 [2023-11-23 06:53:41,769 INFO L226 Difference]: Without dead ends: 119 [2023-11-23 06:53:41,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-23 06:53:41,772 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 118 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:41,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 148 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-23 06:53:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2023-11-23 06:53:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.271186440677966) internal successors, (75), 62 states have internal predecessors, (75), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 06:53:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2023-11-23 06:53:41,778 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 36 [2023-11-23 06:53:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:41,778 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2023-11-23 06:53:41,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:53:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2023-11-23 06:53:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 06:53:41,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:41,781 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:41,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 06:53:41,781 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:41,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:41,782 INFO L85 PathProgramCache]: Analyzing trace with hash -825295797, now seen corresponding path program 1 times [2023-11-23 06:53:41,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:41,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253914208] [2023-11-23 06:53:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:42,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:42,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:42,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:42,252 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 06:53:42,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:42,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253914208] [2023-11-23 06:53:42,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253914208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:42,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:42,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 06:53:42,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670617636] [2023-11-23 06:53:42,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:42,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 06:53:42,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:42,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 06:53:42,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 06:53:42,254 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:53:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:42,473 INFO L93 Difference]: Finished difference Result 167 states and 219 transitions. [2023-11-23 06:53:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 06:53:42,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2023-11-23 06:53:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:42,475 INFO L225 Difference]: With dead ends: 167 [2023-11-23 06:53:42,475 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 06:53:42,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:53:42,475 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 45 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:42,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 120 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 06:53:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2023-11-23 06:53:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 60 states have internal predecessors, (71), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 06:53:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2023-11-23 06:53:42,480 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 36 [2023-11-23 06:53:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:42,481 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2023-11-23 06:53:42,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:53:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2023-11-23 06:53:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 06:53:42,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:42,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:42,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 06:53:42,482 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:42,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash 310706024, now seen corresponding path program 1 times [2023-11-23 06:53:42,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:42,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62789600] [2023-11-23 06:53:42,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:42,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:42,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:42,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:43,044 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 06:53:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62789600] [2023-11-23 06:53:43,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62789600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 06:53:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642989017] [2023-11-23 06:53:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:43,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 06:53:43,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:43,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 06:53:43,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 06:53:43,046 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:53:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:43,431 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2023-11-23 06:53:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 06:53:43,432 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2023-11-23 06:53:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:43,433 INFO L225 Difference]: With dead ends: 101 [2023-11-23 06:53:43,433 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 06:53:43,433 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 06:53:43,433 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 68 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:43,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 246 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 06:53:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 06:53:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2023-11-23 06:53:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 62 states have internal predecessors, (73), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-23 06:53:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2023-11-23 06:53:43,438 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 38 [2023-11-23 06:53:43,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:43,439 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2023-11-23 06:53:43,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 06:53:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2023-11-23 06:53:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 06:53:43,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:43,440 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:43,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 06:53:43,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:43,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:43,440 INFO L85 PathProgramCache]: Analyzing trace with hash -82320986, now seen corresponding path program 1 times [2023-11-23 06:53:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:43,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398568114] [2023-11-23 06:53:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:43,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:43,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:43,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:44,119 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 06:53:44,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:44,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398568114] [2023-11-23 06:53:44,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398568114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:44,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:44,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 06:53:44,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59817126] [2023-11-23 06:53:44,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:44,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 06:53:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:44,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 06:53:44,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:53:44,121 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:53:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:44,367 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2023-11-23 06:53:44,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 06:53:44,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-11-23 06:53:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:44,368 INFO L225 Difference]: With dead ends: 160 [2023-11-23 06:53:44,369 INFO L226 Difference]: Without dead ends: 92 [2023-11-23 06:53:44,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-23 06:53:44,369 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 70 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:44,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 124 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-23 06:53:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2023-11-23 06:53:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 57 states have internal predecessors, (69), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-23 06:53:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2023-11-23 06:53:44,375 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 38 [2023-11-23 06:53:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:44,375 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2023-11-23 06:53:44,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 06:53:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2023-11-23 06:53:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-23 06:53:44,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:44,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:44,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 06:53:44,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:44,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2032892831, now seen corresponding path program 1 times [2023-11-23 06:53:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:44,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645501373] [2023-11-23 06:53:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:44,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:44,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:44,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:44,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:44,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:53:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:44,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:53:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:44,653 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 06:53:44,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:44,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645501373] [2023-11-23 06:53:44,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645501373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:44,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:44,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 06:53:44,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077009945] [2023-11-23 06:53:44,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:44,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 06:53:44,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 06:53:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 06:53:44,656 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 06:53:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:44,765 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2023-11-23 06:53:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 06:53:44,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2023-11-23 06:53:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:44,766 INFO L225 Difference]: With dead ends: 107 [2023-11-23 06:53:44,767 INFO L226 Difference]: Without dead ends: 77 [2023-11-23 06:53:44,767 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 06:53:44,767 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 59 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:44,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 71 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 06:53:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-23 06:53:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-23 06:53:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 57 states have internal predecessors, (68), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-23 06:53:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2023-11-23 06:53:44,772 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 43 [2023-11-23 06:53:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:44,773 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2023-11-23 06:53:44,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 06:53:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2023-11-23 06:53:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-23 06:53:44,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:44,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:44,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 06:53:44,774 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:44,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:44,775 INFO L85 PathProgramCache]: Analyzing trace with hash 479996852, now seen corresponding path program 1 times [2023-11-23 06:53:44,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:44,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895399232] [2023-11-23 06:53:44,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:44,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:45,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:45,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:45,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:53:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:53:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 06:53:45,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:45,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895399232] [2023-11-23 06:53:45,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895399232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:45,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:45,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 06:53:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744090198] [2023-11-23 06:53:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:45,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 06:53:45,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 06:53:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:53:45,271 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 06:53:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:45,503 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2023-11-23 06:53:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 06:53:45,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2023-11-23 06:53:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:45,505 INFO L225 Difference]: With dead ends: 91 [2023-11-23 06:53:45,505 INFO L226 Difference]: Without dead ends: 89 [2023-11-23 06:53:45,505 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 06:53:45,505 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:45,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 193 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-23 06:53:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2023-11-23 06:53:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 66 states have internal predecessors, (75), 15 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-23 06:53:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2023-11-23 06:53:45,510 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 49 [2023-11-23 06:53:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:45,510 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2023-11-23 06:53:45,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 06:53:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2023-11-23 06:53:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 06:53:45,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:45,511 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:45,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 06:53:45,511 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:45,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash 552166382, now seen corresponding path program 1 times [2023-11-23 06:53:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:45,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052721719] [2023-11-23 06:53:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:46,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:46,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:46,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:46,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:53:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:46,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:53:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 06:53:47,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052721719] [2023-11-23 06:53:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052721719] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:53:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127079828] [2023-11-23 06:53:47,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:47,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:53:47,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:53:47,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 06:53:47,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 06:53:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:47,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-23 06:53:47,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:53:47,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2023-11-23 06:53:47,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2023-11-23 06:53:47,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-23 06:53:47,703 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 8 treesize of output 1 [2023-11-23 06:53:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:53:48,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 06:53:49,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127079828] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:53:49,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 06:53:49,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 30 [2023-11-23 06:53:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152084663] [2023-11-23 06:53:49,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 06:53:49,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-23 06:53:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:49,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-23 06:53:49,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2023-11-23 06:53:49,030 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 30 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 9 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-23 06:53:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:51,602 INFO L93 Difference]: Finished difference Result 235 states and 285 transitions. [2023-11-23 06:53:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-23 06:53:51,603 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 9 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) Word has length 53 [2023-11-23 06:53:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:51,604 INFO L225 Difference]: With dead ends: 235 [2023-11-23 06:53:51,604 INFO L226 Difference]: Without dead ends: 189 [2023-11-23 06:53:51,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=617, Invalid=2923, Unknown=0, NotChecked=0, Total=3540 [2023-11-23 06:53:51,606 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 507 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:51,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 186 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 06:53:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-23 06:53:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 125. [2023-11-23 06:53:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 98 states have internal predecessors, (114), 17 states have call successors, (17), 10 states have call predecessors, (17), 14 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2023-11-23 06:53:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2023-11-23 06:53:51,614 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 53 [2023-11-23 06:53:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:51,614 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2023-11-23 06:53:51,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 9 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-23 06:53:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2023-11-23 06:53:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 06:53:51,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:51,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:51,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 06:53:51,828 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,SelfDestructingSolverStorable11 [2023-11-23 06:53:51,829 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:51,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash -458950868, now seen corresponding path program 1 times [2023-11-23 06:53:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:51,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229679387] [2023-11-23 06:53:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:51,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:52,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:52,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:52,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:52,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:52,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:53:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:52,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:53:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:52,682 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 06:53:52,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229679387] [2023-11-23 06:53:52,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229679387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:52,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:52,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 06:53:52,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968474429] [2023-11-23 06:53:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:52,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 06:53:52,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:52,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 06:53:52,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 06:53:52,685 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 06:53:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:53,067 INFO L93 Difference]: Finished difference Result 194 states and 231 transitions. [2023-11-23 06:53:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 06:53:53,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2023-11-23 06:53:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:53,069 INFO L225 Difference]: With dead ends: 194 [2023-11-23 06:53:53,069 INFO L226 Difference]: Without dead ends: 133 [2023-11-23 06:53:53,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-23 06:53:53,072 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 117 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:53,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 102 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 06:53:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-23 06:53:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2023-11-23 06:53:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 17 states have call successors, (17), 10 states have call predecessors, (17), 13 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-23 06:53:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2023-11-23 06:53:53,087 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 53 [2023-11-23 06:53:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:53,088 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2023-11-23 06:53:53,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 06:53:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2023-11-23 06:53:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 06:53:53,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:53,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:53,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 06:53:53,089 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:53,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:53,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2113883496, now seen corresponding path program 1 times [2023-11-23 06:53:53,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:53,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711971842] [2023-11-23 06:53:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:53,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:53,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:53,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:53,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:53:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:53,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:53:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:53,966 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 06:53:53,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711971842] [2023-11-23 06:53:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711971842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:53,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:53,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 06:53:53,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969089033] [2023-11-23 06:53:53,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:53,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 06:53:53,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:53,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 06:53:53,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:53:53,968 INFO L87 Difference]: Start difference. First operand 116 states and 137 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 06:53:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:54,254 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2023-11-23 06:53:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 06:53:54,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2023-11-23 06:53:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:54,256 INFO L225 Difference]: With dead ends: 156 [2023-11-23 06:53:54,256 INFO L226 Difference]: Without dead ends: 120 [2023-11-23 06:53:54,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-23 06:53:54,256 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:54,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 84 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-23 06:53:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2023-11-23 06:53:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 89 states have internal predecessors, (98), 17 states have call successors, (17), 10 states have call predecessors, (17), 13 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-23 06:53:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2023-11-23 06:53:54,282 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 53 [2023-11-23 06:53:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:54,282 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2023-11-23 06:53:54,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 06:53:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2023-11-23 06:53:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 06:53:54,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:54,283 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:54,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 06:53:54,283 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:54,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1469287834, now seen corresponding path program 1 times [2023-11-23 06:53:54,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:54,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837614133] [2023-11-23 06:53:54,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:54,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:54,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:53:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:53:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 06:53:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 06:53:55,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:55,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837614133] [2023-11-23 06:53:55,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837614133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:55,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:55,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 06:53:55,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885417503] [2023-11-23 06:53:55,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:55,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 06:53:55,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:55,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 06:53:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:53:55,022 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 06:53:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:55,243 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2023-11-23 06:53:55,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 06:53:55,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2023-11-23 06:53:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:55,245 INFO L225 Difference]: With dead ends: 122 [2023-11-23 06:53:55,245 INFO L226 Difference]: Without dead ends: 120 [2023-11-23 06:53:55,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-23 06:53:55,245 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:55,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 104 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-23 06:53:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-23 06:53:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 92 states have internal predecessors, (101), 17 states have call successors, (17), 11 states have call predecessors, (17), 14 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-23 06:53:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2023-11-23 06:53:55,252 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 55 [2023-11-23 06:53:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:55,253 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2023-11-23 06:53:55,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 06:53:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2023-11-23 06:53:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 06:53:55,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:55,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:55,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 06:53:55,254 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:55,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash 100723267, now seen corresponding path program 1 times [2023-11-23 06:53:55,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:55,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940434244] [2023-11-23 06:53:55,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:55,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:53:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:53:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 06:53:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:55,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940434244] [2023-11-23 06:53:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940434244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:55,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:55,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 06:53:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890508156] [2023-11-23 06:53:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:55,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 06:53:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:55,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 06:53:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 06:53:55,784 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 06:53:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:56,077 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2023-11-23 06:53:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 06:53:56,077 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2023-11-23 06:53:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:56,080 INFO L225 Difference]: With dead ends: 138 [2023-11-23 06:53:56,080 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 06:53:56,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-11-23 06:53:56,081 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:56,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 245 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 06:53:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 127. [2023-11-23 06:53:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 99 states have internal predecessors, (107), 17 states have call successors, (17), 11 states have call predecessors, (17), 15 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2023-11-23 06:53:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2023-11-23 06:53:56,088 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 55 [2023-11-23 06:53:56,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:56,089 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2023-11-23 06:53:56,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-23 06:53:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2023-11-23 06:53:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 06:53:56,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:56,090 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:56,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 06:53:56,090 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:56,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash -292303743, now seen corresponding path program 1 times [2023-11-23 06:53:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:56,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718784618] [2023-11-23 06:53:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:57,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:57,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:57,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:53:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:53:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:57,169 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 06:53:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:57,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718784618] [2023-11-23 06:53:57,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718784618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:57,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:57,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 06:53:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805541478] [2023-11-23 06:53:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:57,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 06:53:57,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:57,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 06:53:57,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:53:57,173 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 06:53:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:57,432 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2023-11-23 06:53:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 06:53:57,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 55 [2023-11-23 06:53:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:57,433 INFO L225 Difference]: With dead ends: 165 [2023-11-23 06:53:57,433 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 06:53:57,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-23 06:53:57,434 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 58 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:57,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 93 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 06:53:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2023-11-23 06:53:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.1123595505617978) internal successors, (99), 93 states have internal predecessors, (99), 17 states have call successors, (17), 11 states have call predecessors, (17), 14 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-23 06:53:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2023-11-23 06:53:57,441 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 55 [2023-11-23 06:53:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:57,441 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2023-11-23 06:53:57,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 06:53:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2023-11-23 06:53:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-23 06:53:57,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:57,442 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:57,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 06:53:57,442 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:57,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:57,443 INFO L85 PathProgramCache]: Analyzing trace with hash -670288746, now seen corresponding path program 1 times [2023-11-23 06:53:57,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:57,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457751067] [2023-11-23 06:53:57,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:57,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:53:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:53:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 06:53:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 06:53:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 06:53:58,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:58,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457751067] [2023-11-23 06:53:58,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457751067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:53:58,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:53:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 06:53:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376703626] [2023-11-23 06:53:58,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:53:58,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 06:53:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:53:58,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 06:53:58,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 06:53:58,362 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 06:53:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:53:58,614 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2023-11-23 06:53:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 06:53:58,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2023-11-23 06:53:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:53:58,616 INFO L225 Difference]: With dead ends: 127 [2023-11-23 06:53:58,616 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 06:53:58,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-23 06:53:58,616 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:53:58,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 118 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:53:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 06:53:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-23 06:53:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 92 states have (on average 1.108695652173913) internal successors, (102), 96 states have internal predecessors, (102), 17 states have call successors, (17), 12 states have call predecessors, (17), 15 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-23 06:53:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2023-11-23 06:53:58,629 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 61 [2023-11-23 06:53:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:53:58,630 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2023-11-23 06:53:58,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 06:53:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2023-11-23 06:53:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 06:53:58,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:53:58,631 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, 1, 1, 1, 1, 1, 1] [2023-11-23 06:53:58,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 06:53:58,631 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:53:58,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:53:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash -334896133, now seen corresponding path program 1 times [2023-11-23 06:53:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:53:58,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088395966] [2023-11-23 06:53:58,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:58,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:53:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:53:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:53:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:53:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:53:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:59,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 06:53:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 06:53:59,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:53:59,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088395966] [2023-11-23 06:53:59,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088395966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:53:59,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764161984] [2023-11-23 06:53:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:53:59,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:53:59,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:53:59,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 06:53:59,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 06:53:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:53:59,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-23 06:53:59,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:53:59,514 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 37 treesize of output 1 [2023-11-23 06:53:59,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2023-11-23 06:53:59,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 77 [2023-11-23 06:53:59,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 06:53:59,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 144 [2023-11-23 06:53:59,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 29 [2023-11-23 06:53:59,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2023-11-23 06:53:59,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2023-11-23 06:53:59,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-23 06:54:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 06:54:00,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 06:54:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764161984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:00,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 06:54:00,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2023-11-23 06:54:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171830399] [2023-11-23 06:54:00,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:00,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 06:54:00,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:00,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 06:54:00,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-23 06:54:00,317 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 06:54:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:01,135 INFO L93 Difference]: Finished difference Result 225 states and 249 transitions. [2023-11-23 06:54:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 06:54:01,135 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2023-11-23 06:54:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:01,136 INFO L225 Difference]: With dead ends: 225 [2023-11-23 06:54:01,136 INFO L226 Difference]: Without dead ends: 141 [2023-11-23 06:54:01,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2023-11-23 06:54:01,137 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 142 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:01,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 339 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 06:54:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-23 06:54:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2023-11-23 06:54:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.1063829787234043) internal successors, (104), 98 states have internal predecessors, (104), 17 states have call successors, (17), 12 states have call predecessors, (17), 15 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-23 06:54:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2023-11-23 06:54:01,147 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 59 [2023-11-23 06:54:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:01,147 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2023-11-23 06:54:01,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 06:54:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2023-11-23 06:54:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 06:54:01,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:01,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:01,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 06:54:01,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:54:01,349 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:01,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:01,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2114703997, now seen corresponding path program 1 times [2023-11-23 06:54:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:01,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363085184] [2023-11-23 06:54:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:01,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:54:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:54:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:54:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:01,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 06:54:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 06:54:01,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:01,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363085184] [2023-11-23 06:54:01,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363085184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:54:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601198027] [2023-11-23 06:54:01,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:01,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:54:01,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:54:01,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 06:54:01,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 06:54:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:01,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 06:54:01,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:54:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 06:54:01,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 06:54:01,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601198027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:01,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 06:54:01,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-11-23 06:54:01,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422521248] [2023-11-23 06:54:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:01,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 06:54:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 06:54:01,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 06:54:01,983 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 06:54:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:02,047 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2023-11-23 06:54:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 06:54:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 59 [2023-11-23 06:54:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:02,048 INFO L225 Difference]: With dead ends: 244 [2023-11-23 06:54:02,048 INFO L226 Difference]: Without dead ends: 131 [2023-11-23 06:54:02,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 06:54:02,052 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 23 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:02,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 194 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 06:54:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-23 06:54:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2023-11-23 06:54:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 17 states have call successors, (17), 12 states have call predecessors, (17), 15 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-23 06:54:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2023-11-23 06:54:02,093 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 59 [2023-11-23 06:54:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:02,094 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2023-11-23 06:54:02,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 06:54:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2023-11-23 06:54:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 06:54:02,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:02,095 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:02,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 06:54:02,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:54:02,295 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:02,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1520731777, now seen corresponding path program 1 times [2023-11-23 06:54:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:02,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293080061] [2023-11-23 06:54:02,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:02,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:03,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:03,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:54:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:03,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:54:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:54:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:03,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 06:54:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 06:54:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293080061] [2023-11-23 06:54:04,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293080061] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:54:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044081824] [2023-11-23 06:54:04,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:04,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:54:04,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:54:04,106 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 06:54:04,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 06:54:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:04,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 2480 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-23 06:54:04,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:54:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 06:54:05,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 06:54:05,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044081824] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:54:05,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 06:54:05,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2023-11-23 06:54:05,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834390744] [2023-11-23 06:54:05,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 06:54:05,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-23 06:54:05,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:05,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-23 06:54:05,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2023-11-23 06:54:05,457 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 21 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 18 states have internal predecessors, (70), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-23 06:54:07,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 06:54:09,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 06:54:12,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 06:54:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:13,086 INFO L93 Difference]: Finished difference Result 296 states and 312 transitions. [2023-11-23 06:54:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 06:54:13,112 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 18 states have internal predecessors, (70), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 59 [2023-11-23 06:54:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:13,113 INFO L225 Difference]: With dead ends: 296 [2023-11-23 06:54:13,113 INFO L226 Difference]: Without dead ends: 199 [2023-11-23 06:54:13,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=1333, Unknown=0, NotChecked=0, Total=1640 [2023-11-23 06:54:13,114 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 175 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:13,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 279 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1191 Invalid, 3 Unknown, 0 Unchecked, 7.1s Time] [2023-11-23 06:54:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-11-23 06:54:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 127. [2023-11-23 06:54:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 96 states have (on average 1.0625) internal successors, (102), 98 states have internal predecessors, (102), 16 states have call successors, (16), 13 states have call predecessors, (16), 14 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-23 06:54:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2023-11-23 06:54:13,139 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 59 [2023-11-23 06:54:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:13,139 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2023-11-23 06:54:13,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 18 states have internal predecessors, (70), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-23 06:54:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2023-11-23 06:54:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 06:54:13,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:13,140 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:13,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-23 06:54:13,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:54:13,341 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:13,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:13,341 INFO L85 PathProgramCache]: Analyzing trace with hash -66823228, now seen corresponding path program 1 times [2023-11-23 06:54:13,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:13,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944726922] [2023-11-23 06:54:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:13,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:13,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:54:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:54:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:13,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:54:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:13,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:54:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:13,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 06:54:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 06:54:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:13,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 06:54:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 06:54:13,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944726922] [2023-11-23 06:54:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944726922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:13,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:13,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 06:54:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527124052] [2023-11-23 06:54:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:13,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 06:54:13,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 06:54:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 06:54:13,990 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 06:54:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:14,234 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2023-11-23 06:54:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 06:54:14,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 67 [2023-11-23 06:54:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:14,235 INFO L225 Difference]: With dead ends: 133 [2023-11-23 06:54:14,236 INFO L226 Difference]: Without dead ends: 131 [2023-11-23 06:54:14,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-23 06:54:14,237 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:14,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 104 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 06:54:14,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-23 06:54:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-11-23 06:54:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 101 states have internal predecessors, (105), 16 states have call successors, (16), 14 states have call predecessors, (16), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-23 06:54:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2023-11-23 06:54:14,249 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 67 [2023-11-23 06:54:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:14,250 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2023-11-23 06:54:14,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 06:54:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2023-11-23 06:54:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-23 06:54:14,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:14,251 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:14,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-23 06:54:14,251 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:14,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash -599646322, now seen corresponding path program 1 times [2023-11-23 06:54:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:14,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746527770] [2023-11-23 06:54:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:54:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:54:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:54:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:54:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 06:54:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 06:54:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 06:54:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 06:54:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-23 06:54:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:15,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746527770] [2023-11-23 06:54:15,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746527770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:15,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:15,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 06:54:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011943183] [2023-11-23 06:54:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:15,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 06:54:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:15,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 06:54:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-23 06:54:15,840 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 06:54:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:16,270 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2023-11-23 06:54:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 06:54:16,270 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 74 [2023-11-23 06:54:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:16,271 INFO L225 Difference]: With dead ends: 137 [2023-11-23 06:54:16,271 INFO L226 Difference]: Without dead ends: 133 [2023-11-23 06:54:16,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-23 06:54:16,272 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:16,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 139 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 06:54:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-23 06:54:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-11-23 06:54:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 102 states have internal predecessors, (106), 16 states have call successors, (16), 15 states have call predecessors, (16), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-23 06:54:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2023-11-23 06:54:16,291 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 74 [2023-11-23 06:54:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:16,293 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2023-11-23 06:54:16,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 06:54:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2023-11-23 06:54:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-23 06:54:16,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:16,296 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:16,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-23 06:54:16,296 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:16,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash -729094973, now seen corresponding path program 1 times [2023-11-23 06:54:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:16,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364690392] [2023-11-23 06:54:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:54:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:54:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:54:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:54:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 06:54:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 06:54:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 06:54:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 06:54:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 06:54:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 06:54:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 06:54:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-23 06:54:17,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364690392] [2023-11-23 06:54:17,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364690392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:17,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 06:54:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901049809] [2023-11-23 06:54:17,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:17,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 06:54:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:17,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 06:54:17,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-11-23 06:54:17,741 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-11-23 06:54:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:18,166 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2023-11-23 06:54:18,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 06:54:18,167 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 90 [2023-11-23 06:54:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:18,168 INFO L225 Difference]: With dead ends: 168 [2023-11-23 06:54:18,168 INFO L226 Difference]: Without dead ends: 132 [2023-11-23 06:54:18,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-11-23 06:54:18,168 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 71 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:18,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 167 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 06:54:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-23 06:54:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2023-11-23 06:54:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 06:54:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2023-11-23 06:54:18,185 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 90 [2023-11-23 06:54:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:18,185 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2023-11-23 06:54:18,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-11-23 06:54:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2023-11-23 06:54:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-23 06:54:18,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:18,188 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:18,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-23 06:54:18,188 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:18,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:18,188 INFO L85 PathProgramCache]: Analyzing trace with hash 178033428, now seen corresponding path program 1 times [2023-11-23 06:54:18,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:18,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340373539] [2023-11-23 06:54:18,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:18,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:54:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:54:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 06:54:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:54:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 06:54:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 06:54:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 06:54:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 06:54:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 06:54:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 06:54:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 06:54:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-23 06:54:19,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:19,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340373539] [2023-11-23 06:54:19,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340373539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 06:54:19,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834248646] [2023-11-23 06:54:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:19,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:54:19,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 06:54:19,528 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 06:54:19,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 06:54:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:20,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-23 06:54:20,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 06:54:20,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-23 06:54:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 39 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 06:54:20,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 06:54:20,810 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-23 06:54:20,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2023-11-23 06:54:20,816 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-23 06:54:20,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2023-11-23 06:54:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-23 06:54:20,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834248646] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 06:54:20,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 06:54:20,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 24 [2023-11-23 06:54:20,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694029158] [2023-11-23 06:54:20,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 06:54:20,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-23 06:54:20,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:20,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-23 06:54:20,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2023-11-23 06:54:20,844 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand has 24 states, 22 states have (on average 4.2727272727272725) internal successors, (94), 20 states have internal predecessors, (94), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) [2023-11-23 06:54:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:21,910 INFO L93 Difference]: Finished difference Result 157 states and 163 transitions. [2023-11-23 06:54:21,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-23 06:54:21,911 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.2727272727272725) internal successors, (94), 20 states have internal predecessors, (94), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) Word has length 96 [2023-11-23 06:54:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:21,912 INFO L225 Difference]: With dead ends: 157 [2023-11-23 06:54:21,912 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 06:54:21,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 198 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2023-11-23 06:54:21,913 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 124 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:21,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 228 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 06:54:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 06:54:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-23 06:54:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.0) internal successors, (72), 72 states have internal predecessors, (72), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 06:54:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2023-11-23 06:54:21,925 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2023-11-23 06:54:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:21,925 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2023-11-23 06:54:21,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.2727272727272725) internal successors, (94), 20 states have internal predecessors, (94), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) [2023-11-23 06:54:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2023-11-23 06:54:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-23 06:54:21,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 06:54:21,926 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:21,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 06:54:22,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 06:54:22,142 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 06:54:22,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 06:54:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1082716957, now seen corresponding path program 1 times [2023-11-23 06:54:22,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 06:54:22,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707336788] [2023-11-23 06:54:22,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 06:54:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 06:54:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 06:54:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 06:54:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 06:54:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 06:54:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 06:54:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 06:54:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 06:54:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 06:54:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 06:54:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 06:54:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 06:54:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 06:54:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 06:54:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-23 06:54:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 06:54:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707336788] [2023-11-23 06:54:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707336788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 06:54:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 06:54:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 06:54:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087140377] [2023-11-23 06:54:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 06:54:24,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 06:54:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 06:54:24,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 06:54:24,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-11-23 06:54:24,662 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-23 06:54:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 06:54:25,167 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2023-11-23 06:54:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 06:54:25,167 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 102 [2023-11-23 06:54:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 06:54:25,168 INFO L225 Difference]: With dead ends: 99 [2023-11-23 06:54:25,168 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 06:54:25,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-23 06:54:25,171 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 06:54:25,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 155 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 06:54:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 06:54:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 06:54:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 06:54:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 06:54:25,173 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2023-11-23 06:54:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 06:54:25,173 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 06:54:25,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-23 06:54:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 06:54:25,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 06:54:25,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 06:54:25,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-23 06:54:25,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 06:54:34,644 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 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7375 7381) the Hoare annotation is: true [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2023-11-23 06:54:34,644 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point L8219-1(line 8219) no Hoare annotation was computed. [2023-11-23 06:54:34,645 INFO L895 garLoopResultBuilder]: At program point L8219(line 8219) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) [2023-11-23 06:54:34,645 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2023-11-23 06:54:34,646 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse16 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse15 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse17 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse14 (select .cse16 8))) (let ((.cse0 (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0)) (.cse2 (= .cse14 0)) (.cse6 (= (select .cse17 16) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= (select .cse17 0) 0)) (.cse8 (= (select .cse16 24) 0)) (.cse9 (= (select .cse15 8) 0)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse11 (= (select .cse15 24) 0)) (.cse12 (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (let ((.cse1 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= .cse14 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and .cse0 (or .cse1 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (or .cse1 .cse2) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) (.cse3 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse3 .cse4) 0) (= (select (select |#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) .cse4) 0) (= (select .cse3 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse5 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) 0) (<= 1 (mod (select (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) (+ 16 |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5|)) 18446744073709551616)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0))))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) .cse12 .cse13)) (and .cse0 .cse2 .cse6 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0) (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))))) [2023-11-23 06:54:34,646 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 06:54:34,649 INFO L895 garLoopResultBuilder]: At program point L8230(line 8230) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse0 (select .cse4 8)) (.cse5 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse3 (select .cse5 16)) (.cse1 (= .cse0 0)) (.cse2 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (and (or (= .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse1) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0)) (= (select .cse2 24) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse3) (= (select .cse4 24) 0) (= (select .cse5 0) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (or (< 0 (mod .cse3 18446744073709551616)) .cse1) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= (select .cse2 8) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-23 06:54:34,649 INFO L902 garLoopResultBuilder]: At program point L8963(line 8963) the Hoare annotation is: true [2023-11-23 06:54:34,649 INFO L899 garLoopResultBuilder]: For program point L8963-1(line 8963) no Hoare annotation was computed. [2023-11-23 06:54:34,650 INFO L895 garLoopResultBuilder]: At program point L8969(lines 8969 8971) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse6 8))) (let ((.cse5 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse1 (= .cse0 0))) (and (or (= .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse1) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1219#1.offset| 0) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) (.cse2 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse2 .cse3) 0) (= (select (select |#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) .cse3) 0) (= (select .cse2 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse4 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) 0) (<= 1 (mod (select (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) (+ 16 |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5|)) 18446744073709551616)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0))))) (= (select .cse5 16) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= (select .cse5 0) 0) (= (select .cse6 24) 0) (= (select .cse7 8) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse7 24) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1219#1.base| 0) (or (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse1) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-23 06:54:34,650 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2023-11-23 06:54:34,650 INFO L899 garLoopResultBuilder]: For program point L8969-1(lines 8969 8971) no Hoare annotation was computed. [2023-11-23 06:54:34,650 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse6 8))) (let ((.cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|))) (.cse5 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (or .cse0 (= .cse1 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) (.cse2 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse2 .cse3) 0) (= (select (select |#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) .cse3) 0) (= (select .cse2 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse4 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) 0) (<= 1 (mod (select (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) (+ 16 |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5|)) 18446744073709551616)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0))))) (= (select .cse5 16) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= (select .cse5 0) 0) (= (select .cse6 24) 0) (= (select .cse7 8) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse7 24) 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-23 06:54:34,650 INFO L899 garLoopResultBuilder]: For program point L8230-2(line 8230) no Hoare annotation was computed. [2023-11-23 06:54:34,650 INFO L895 garLoopResultBuilder]: At program point L8967(line 8967) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse14 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse13 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1217#1| 0)) (.cse1 (select .cse13 8)) (.cse5 (= (select .cse14 16) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (= (select .cse14 0) 0)) (.cse7 (= (select .cse13 24) 0)) (.cse8 (= (select .cse12 8) 0)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse10 (= (select .cse12 24) 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse0 (= .cse1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) (.cse2 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse2 .cse3) 0) (= (select (select |#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) .cse3) 0) (= (select .cse2 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse4 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) 0) (<= 1 (mod (select (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) (+ 16 |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5|)) 18446744073709551616)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0))))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (= .cse1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2023-11-23 06:54:34,651 INFO L895 garLoopResultBuilder]: At program point L8230-1(line 8230) the Hoare annotation is: (let ((.cse17 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse16 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse0 (select .cse17 16)) (.cse15 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse1 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse2 (= (select .cse15 24) 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse0)) (.cse4 (= (select .cse16 24) 0)) (.cse5 (= (select .cse17 0) 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1060#1| 1)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (select .cse16 8)) (.cse11 (= (select .cse15 8) 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and (< 0 (mod .cse0 18446744073709551616)) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse6 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (= .cse7 0) .cse11 .cse12 .cse13 .cse14))))) [2023-11-23 06:54:34,651 INFO L899 garLoopResultBuilder]: For program point L8967-1(line 8967) no Hoare annotation was computed. [2023-11-23 06:54:34,651 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2023-11-23 06:54:34,651 INFO L899 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2023-11-23 06:54:34,651 INFO L899 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2023-11-23 06:54:34,651 INFO L895 garLoopResultBuilder]: At program point L8966-1(line 8966) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse14 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse13 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse13 8)) (.cse1 (= (select .cse14 16) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse2 (= (select .cse14 0) 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1216#1| 1)) (.cse4 (= (select .cse13 24) 0)) (.cse5 (= (select .cse12 8) 0)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse7 (= (select .cse12 24) 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and (= .cse0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) (.cse9 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse9 .cse10) 0) (= (select (select |#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) .cse10) 0) (= (select .cse9 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse11 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse11 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) 0) (<= 1 (mod (select (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) (+ 16 |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5|)) 18446744073709551616)) (= (select .cse11 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0))))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2023-11-23 06:54:34,652 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse6 8))) (let ((.cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|))) (.cse5 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (and (= (+ |ULTIMATE.start_assert_bytes_match_#t~mem594#1| (* (div |ULTIMATE.start_assert_bytes_match_#t~mem593#1| 256) 256)) (+ (* (div |ULTIMATE.start_assert_bytes_match_#t~mem594#1| 256) 256) |ULTIMATE.start_assert_bytes_match_#t~mem593#1|)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (or .cse0 (= .cse1 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) (.cse2 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse2 .cse3) 0) (= (select (select |#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) .cse3) 0) (= (select .cse2 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse4 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) 0) (<= 1 (mod (select (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) (+ 16 |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5|)) 18446744073709551616)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0))))) (= (select .cse5 16) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= (select .cse5 0) 0) (= (select .cse6 24) 0) (= (select .cse7 8) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse7 24) 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-23 06:54:34,652 INFO L899 garLoopResultBuilder]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2023-11-23 06:54:34,652 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse6 8))) (let ((.cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|))) (.cse5 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (or .cse0 (= .cse1 0)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) (.cse2 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse2 .cse3) 0) (= (select (select |#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) .cse3) 0) (= (select .cse2 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse4 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) 0) (<= 1 (mod (select (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) (+ 16 |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5|)) 18446744073709551616)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0))))) (= (select .cse5 16) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= (select .cse5 0) 0) (= (select .cse6 24) 0) (= (select .cse7 8) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse7 24) 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-23 06:54:34,652 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse14 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse13 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse13 8)) (.cse1 (= (select .cse14 16) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse2 (= (select .cse14 0) 0)) (.cse3 (= (select .cse13 24) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1218#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= (select .cse12 8) 0)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse7 (= (select .cse12 24) 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and (= .cse0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) (.cse9 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse9 .cse10) 0) (= (select (select |#memory_$Pointer$#4.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) .cse10) 0) (= (select .cse9 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| Int)) (let ((.cse11 (select |#memory_$Pointer$#4.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|))) (and (= (select .cse11 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 8)) 0) (<= 1 (mod (select (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_5|) (+ 16 |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5|)) 18446744073709551616)) (= (select .cse11 (+ |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset_BEFORE_CALL_5| 24)) 0))))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2023-11-23 06:54:34,652 INFO L899 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2023-11-23 06:54:34,652 INFO L895 garLoopResultBuilder]: At program point L8966(line 8966) the Hoare annotation is: (let ((.cse11 (select |#memory_int#4| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse9 (select |#memory_$Pointer$#4.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse2 (select .cse11 16)) (.cse10 (select |#memory_$Pointer$#4.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse10 8)) (.cse1 (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse3 (= (select .cse11 0) 0)) (.cse4 (= (select .cse10 24) 0)) (.cse5 (= (select .cse9 8) 0)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse7 (= (select .cse9 24) 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse1 (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse2 (- 1)) 18446744073709551616)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= .cse0 0) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))))) [2023-11-23 06:54:34,653 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2023-11-23 06:54:34,653 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 06:54:34,653 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 06:54:34,653 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 06:54:34,653 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 06:54:34,653 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 06:54:34,653 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 06:54:34,656 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 06:54:34,657 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 06:54:34,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:54:34 BoogieIcfgContainer [2023-11-23 06:54:34,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 06:54:34,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 06:54:34,685 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 06:54:34,685 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 06:54:34,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:53:30" (3/4) ... [2023-11-23 06:54:34,688 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 06:54:34,690 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-23 06:54:34,691 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-23 06:54:34,691 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2023-11-23 06:54:34,691 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 06:54:34,691 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 06:54:34,715 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2023-11-23 06:54:34,716 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2023-11-23 06:54:34,717 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-23 06:54:34,718 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-23 06:54:34,718 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 06:54:34,719 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 06:54:34,719 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-23 06:54:34,720 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 06:54:35,127 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 06:54:35,128 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 06:54:35,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 06:54:35,129 INFO L158 Benchmark]: Toolchain (without parser) took 67987.42ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 130.6MB in the beginning and 751.9MB in the end (delta: -621.3MB). Peak memory consumption was 595.8MB. Max. memory is 16.1GB. [2023-11-23 06:54:35,129 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 06:54:35,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2368.07ms. Allocated memory is still 174.1MB. Free memory was 129.8MB in the beginning and 85.2MB in the end (delta: 44.6MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2023-11-23 06:54:35,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.51ms. Allocated memory is still 174.1MB. Free memory was 85.2MB in the beginning and 73.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 06:54:35,131 INFO L158 Benchmark]: Boogie Preprocessor took 150.60ms. Allocated memory is still 174.1MB. Free memory was 73.8MB in the beginning and 59.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-23 06:54:35,133 INFO L158 Benchmark]: RCFGBuilder took 1044.22ms. Allocated memory was 174.1MB in the beginning and 232.8MB in the end (delta: 58.7MB). Free memory was 59.1MB in the beginning and 124.9MB in the end (delta: -65.8MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2023-11-23 06:54:35,133 INFO L158 Benchmark]: TraceAbstraction took 63828.31ms. Allocated memory was 232.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.8MB in the beginning and 883.0MB in the end (delta: -759.2MB). Peak memory consumption was 639.6MB. Max. memory is 16.1GB. [2023-11-23 06:54:35,138 INFO L158 Benchmark]: Witness Printer took 443.27ms. Allocated memory is still 1.4GB. Free memory was 883.0MB in the beginning and 751.9MB in the end (delta: 131.1MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2023-11-23 06:54:35,140 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2368.07ms. Allocated memory is still 174.1MB. Free memory was 129.8MB in the beginning and 85.2MB in the end (delta: 44.6MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 136.51ms. Allocated memory is still 174.1MB. Free memory was 85.2MB in the beginning and 73.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 150.60ms. Allocated memory is still 174.1MB. Free memory was 73.8MB in the beginning and 59.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1044.22ms. Allocated memory was 174.1MB in the beginning and 232.8MB in the end (delta: 58.7MB). Free memory was 59.1MB in the beginning and 124.9MB in the end (delta: -65.8MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * TraceAbstraction took 63828.31ms. Allocated memory was 232.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.8MB in the beginning and 883.0MB in the end (delta: -759.2MB). Peak memory consumption was 639.6MB. Max. memory is 16.1GB. * Witness Printer took 443.27ms. Allocated memory is still 1.4GB. Free memory was 883.0MB in the beginning and 751.9MB in the end (delta: 131.1MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8269]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] - GenericResultAtLocation [Line: 8755]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.8s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 2361 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2237 mSDsluCounter, 4191 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3257 mSDsCounter, 516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11043 IncrementalHoareTripleChecker+Invalid, 11562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 516 mSolverCounterUnsat, 934 mSDtfsCounter, 11043 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1266 GetRequests, 830 SyntacticMatches, 23 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=23, InterpolantAutomatonStates: 280, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 322 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 193 PreInvPairs, 216 NumberOfFragments, 1738 HoareAnnotationTreeSize, 193 FomulaSimplifications, 4934 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 11096 FormulaSimplificationTreeSizeReductionInter, 9.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 1749 NumberOfCodeBlocks, 1749 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1847 ConstructedInterpolants, 114 QuantifiedInterpolants, 14862 SizeOfPredicates, 78 NumberOfNonLiveVariables, 14905 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 843/926 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-23 06:54:35,241 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