./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_string_eq_c_str_ignore_case_harness.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_string_eq_c_str_ignore_case_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 6334acf6662f715682aa436867bb49f37f46bbf05c989a8d5c50953f6022f7ef --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 09:11:51,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 09:11:51,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 09:11:51,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 09:11:51,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 09:11:51,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 09:11:51,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 09:11:51,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 09:11:51,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 09:11:51,302 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 09:11:51,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 09:11:51,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 09:11:51,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 09:11:51,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 09:11:51,303 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 09:11:51,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 09:11:51,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 09:11:51,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 09:11:51,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 09:11:51,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 09:11:51,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 09:11:51,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 09:11:51,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 09:11:51,306 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 09:11:51,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 09:11:51,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 09:11:51,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 09:11:51,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 09:11:51,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 09:11:51,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 09:11:51,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 09:11:51,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 09:11:51,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 09:11:51,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 09:11:51,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 09:11:51,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 09:11:51,308 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 09:11:51,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 09:11:51,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 09:11:51,309 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 -> 6334acf6662f715682aa436867bb49f37f46bbf05c989a8d5c50953f6022f7ef Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 09:11:51,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 09:11:51,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 09:11:51,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 09:11:51,489 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 09:11:51,490 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 09:11:51,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_string_eq_c_str_ignore_case_harness.i [2023-11-23 09:11:52,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 09:11:52,872 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 09:11:52,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_c_str_ignore_case_harness.i [2023-11-23 09:11:52,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf2d4af0/62376ac8a2e24d64a9dd2d3c81200d6e/FLAGd7f9d0a7d [2023-11-23 09:11:52,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf2d4af0/62376ac8a2e24d64a9dd2d3c81200d6e [2023-11-23 09:11:52,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 09:11:52,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 09:11:52,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 09:11:52,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 09:11:52,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 09:11:52,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:11:52" (1/1) ... [2023-11-23 09:11:52,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42340491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52, skipping insertion in model container [2023-11-23 09:11:52,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:11:52" (1/1) ... [2023-11-23 09:11:53,015 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 09:11:53,252 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_string_eq_c_str_ignore_case_harness.i[4505,4518] [2023-11-23 09:11:53,258 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_string_eq_c_str_ignore_case_harness.i[4565,4578] [2023-11-23 09:11:53,851 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:53,853 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:53,854 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:53,854 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:53,855 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:53,866 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:53,866 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:53,869 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:53,869 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,106 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 09:11:54,107 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 09:11:54,107 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 09:11:54,109 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 09:11:54,110 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 09:11:54,110 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 09:11:54,110 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 09:11:54,111 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 09:11:54,112 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 09:11:54,114 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 09:11:54,268 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,269 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 09:11:54,308 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 09:11:54,326 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_string_eq_c_str_ignore_case_harness.i[4505,4518] [2023-11-23 09:11:54,326 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_string_eq_c_str_ignore_case_harness.i[4565,4578] [2023-11-23 09:11:54,366 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,373 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,373 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,374 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,374 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,380 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,382 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,383 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,383 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,399 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 09:11:54,399 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 09:11:54,400 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 09:11:54,400 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 09:11:54,401 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 09:11:54,401 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 09:11:54,401 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 09:11:54,402 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 09:11:54,402 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 09:11:54,402 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 09:11:54,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8588] [2023-11-23 09:11:54,462 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,463 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 09:11:54,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 09:11:54,649 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,650 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,650 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,650 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,650 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,650 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,650 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,651 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,651 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,651 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,651 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,652 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,652 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,652 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,652 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,653 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,653 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 09:11:54,658 INFO L206 MainTranslator]: Completed translation [2023-11-23 09:11:54,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54 WrapperNode [2023-11-23 09:11:54,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 09:11:54,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 09:11:54,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 09:11:54,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 09:11:54,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,803 INFO L138 Inliner]: procedures = 680, calls = 2272, calls flagged for inlining = 59, calls inlined = 7, statements flattened = 372 [2023-11-23 09:11:54,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 09:11:54,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 09:11:54,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 09:11:54,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 09:11:54,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 09:11:54,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 09:11:54,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 09:11:54,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 09:11:54,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (1/1) ... [2023-11-23 09:11:54,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 09:11:54,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:11:54,867 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 09:11:54,891 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 09:11:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-23 09:11:54,909 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-23 09:11:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2023-11-23 09:11:54,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2023-11-23 09:11:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 09:11:54,909 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 09:11:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 09:11:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 09:11:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 09:11:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 09:11:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 09:11:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 09:11:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 09:11:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 09:11:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 09:11:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 09:11:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 09:11:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 09:11:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 09:11:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 09:11:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 09:11:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 09:11:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 09:11:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 09:11:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str_ignore_case [2023-11-23 09:11:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str_ignore_case [2023-11-23 09:11:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 09:11:55,131 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 09:11:55,133 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 09:11:55,436 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 09:11:55,510 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 09:11:55,510 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 09:11:55,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:11:55 BoogieIcfgContainer [2023-11-23 09:11:55,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 09:11:55,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 09:11:55,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 09:11:55,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 09:11:55,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:11:52" (1/3) ... [2023-11-23 09:11:55,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7473e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:11:55, skipping insertion in model container [2023-11-23 09:11:55,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:54" (2/3) ... [2023-11-23 09:11:55,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7473e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:11:55, skipping insertion in model container [2023-11-23 09:11:55,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:11:55" (3/3) ... [2023-11-23 09:11:55,520 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_c_str_ignore_case_harness.i [2023-11-23 09:11:55,534 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 09:11:55,535 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 09:11:55,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 09:11:55,592 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;@34263216, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 09:11:55,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 09:11:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 53 states have internal predecessors, (68), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 09:11:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 09:11:55,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:11:55,609 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:11:55,610 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:11:55,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:11:55,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2039203987, now seen corresponding path program 1 times [2023-11-23 09:11:55,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:11:55,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237817627] [2023-11-23 09:11:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:11:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:11:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:55,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:55,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 09:11:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:55,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 09:11:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:55,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 09:11:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 09:11:55,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:11:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237817627] [2023-11-23 09:11:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237817627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:11:55,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:11:55,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 09:11:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320051144] [2023-11-23 09:11:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:11:55,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 09:11:55,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:11:56,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 09:11:56,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 09:11:56,022 INFO L87 Difference]: Start difference. First operand has 85 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 53 states have internal predecessors, (68), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 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 09:11:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:11:56,098 INFO L93 Difference]: Finished difference Result 162 states and 225 transitions. [2023-11-23 09:11:56,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 09:11:56,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 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 32 [2023-11-23 09:11:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:11:56,107 INFO L225 Difference]: With dead ends: 162 [2023-11-23 09:11:56,108 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 09:11:56,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 09:11:56,116 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 09:11:56,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 09:11:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 09:11:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 09:11:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 09:11:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2023-11-23 09:11:56,166 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 32 [2023-11-23 09:11:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:11:56,167 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2023-11-23 09:11:56,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 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 09:11:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2023-11-23 09:11:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 09:11:56,174 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:11:56,175 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:11:56,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 09:11:56,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:11:56,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:11:56,176 INFO L85 PathProgramCache]: Analyzing trace with hash 261618603, now seen corresponding path program 1 times [2023-11-23 09:11:56,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:11:56,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704311812] [2023-11-23 09:11:56,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:11:56,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:11:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:56,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 09:11:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:56,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 09:11:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:56,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 09:11:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 09:11:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:11:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704311812] [2023-11-23 09:11:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704311812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:11:56,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:11:56,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 09:11:56,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244463052] [2023-11-23 09:11:56,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:11:56,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 09:11:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:11:56,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 09:11:56,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 09:11:56,494 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 09:11:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:11:56,591 INFO L93 Difference]: Finished difference Result 122 states and 160 transitions. [2023-11-23 09:11:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 09:11:56,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2023-11-23 09:11:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:11:56,593 INFO L225 Difference]: With dead ends: 122 [2023-11-23 09:11:56,593 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 09:11:56,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 09:11:56,594 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 09:11:56,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 275 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 09:11:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 09:11:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 09:11:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 09:11:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2023-11-23 09:11:56,600 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 32 [2023-11-23 09:11:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:11:56,601 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2023-11-23 09:11:56,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 09:11:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2023-11-23 09:11:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-23 09:11:56,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:11:56,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:11:56,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 09:11:56,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:11:56,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:11:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash -570145929, now seen corresponding path program 1 times [2023-11-23 09:11:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:11:56,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536775121] [2023-11-23 09:11:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:11:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:11:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:11:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:57,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:11:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:57,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 09:11:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:57,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:57,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 09:11:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:57,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:11:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:57,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 09:11:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:57,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 09:11:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 09:11:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:11:57,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536775121] [2023-11-23 09:11:57,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536775121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:11:57,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:11:57,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 09:11:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714017553] [2023-11-23 09:11:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:11:57,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 09:11:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:11:57,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 09:11:57,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-23 09:11:57,226 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 09:11:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:11:57,663 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2023-11-23 09:11:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 09:11:57,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 61 [2023-11-23 09:11:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:11:57,665 INFO L225 Difference]: With dead ends: 122 [2023-11-23 09:11:57,665 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 09:11:57,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-23 09:11:57,666 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 09:11:57,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 393 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 09:11:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 09:11:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 09:11:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 09:11:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2023-11-23 09:11:57,673 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 61 [2023-11-23 09:11:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:11:57,673 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2023-11-23 09:11:57,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 09:11:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2023-11-23 09:11:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 09:11:57,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:11:57,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:11:57,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 09:11:57,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:11:57,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:11:57,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1995930055, now seen corresponding path program 1 times [2023-11-23 09:11:57,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:11:57,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097697811] [2023-11-23 09:11:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:11:57,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:11:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:11:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:11:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 09:11:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 09:11:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:11:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 09:11:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 09:11:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:11:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 09:11:58,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:11:58,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097697811] [2023-11-23 09:11:58,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097697811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:11:58,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:11:58,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 09:11:58,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266834321] [2023-11-23 09:11:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:11:58,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 09:11:58,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:11:58,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 09:11:58,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-23 09:11:58,227 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 13 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 09:11:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:11:58,600 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2023-11-23 09:11:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 09:11:58,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2023-11-23 09:11:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:11:58,602 INFO L225 Difference]: With dead ends: 102 [2023-11-23 09:11:58,602 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 09:11:58,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-23 09:11:58,603 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 09:11:58,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 373 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 09:11:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 09:11:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 09:11:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.18) internal successors, (59), 51 states have internal predecessors, (59), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 09:11:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2023-11-23 09:11:58,613 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 69 [2023-11-23 09:11:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:11:58,613 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2023-11-23 09:11:58,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-23 09:11:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2023-11-23 09:11:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 09:11:58,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:11:58,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:11:58,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 09:11:58,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:11:58,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:11:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1937394201, now seen corresponding path program 1 times [2023-11-23 09:11:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:11:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346420359] [2023-11-23 09:11:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:11:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:11:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:11:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:11:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 09:11:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 09:11:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:11:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 09:11:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 09:11:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 09:11:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 09:11:58,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:11:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346420359] [2023-11-23 09:11:58,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346420359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:11:58,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:11:58,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 09:11:58,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226701389] [2023-11-23 09:11:58,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:11:58,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 09:11:58,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:11:58,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 09:11:58,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 09:11:58,885 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-23 09:11:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:11:59,077 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2023-11-23 09:11:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 09:11:59,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 70 [2023-11-23 09:11:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:11:59,081 INFO L225 Difference]: With dead ends: 112 [2023-11-23 09:11:59,081 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 09:11:59,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 09:11:59,119 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 09:11:59,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 09:11:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 09:11:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 09:11:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 09:11:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2023-11-23 09:11:59,138 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 70 [2023-11-23 09:11:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:11:59,141 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2023-11-23 09:11:59,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-23 09:11:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2023-11-23 09:11:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-23 09:11:59,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:11:59,143 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:11:59,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 09:11:59,144 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:11:59,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:11:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash -222594695, now seen corresponding path program 1 times [2023-11-23 09:11:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:11:59,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759662872] [2023-11-23 09:11:59,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:11:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:11:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:11:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:11:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 09:11:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 09:11:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:11:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 09:11:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 09:11:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:11:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:11:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:11:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 09:11:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 09:11:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 09:11:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:11:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-23 09:11:59,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:11:59,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759662872] [2023-11-23 09:11:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759662872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:11:59,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:11:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-23 09:11:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553982824] [2023-11-23 09:11:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:11:59,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 09:11:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:11:59,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 09:11:59,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-11-23 09:11:59,945 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 16 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 09:12:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:12:00,316 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2023-11-23 09:12:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 09:12:00,317 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) Word has length 95 [2023-11-23 09:12:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:12:00,318 INFO L225 Difference]: With dead ends: 102 [2023-11-23 09:12:00,318 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 09:12:00,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2023-11-23 09:12:00,318 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 09:12:00,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 355 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 09:12:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 09:12:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 09:12:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.14) internal successors, (57), 51 states have internal predecessors, (57), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 09:12:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2023-11-23 09:12:00,323 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 95 [2023-11-23 09:12:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:12:00,324 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2023-11-23 09:12:00,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.642857142857143) internal successors, (37), 11 states have internal predecessors, (37), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-23 09:12:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2023-11-23 09:12:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 09:12:00,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:12:00,325 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:00,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 09:12:00,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:12:00,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:12:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1968660091, now seen corresponding path program 1 times [2023-11-23 09:12:00,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:12:00,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494419695] [2023-11-23 09:12:00,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:12:00,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:12:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:12:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:12:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 09:12:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 09:12:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:12:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 09:12:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 09:12:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:12:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:12:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 09:12:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 09:12:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 09:12:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 09:12:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:12:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-23 09:12:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:12:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494419695] [2023-11-23 09:12:04,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494419695] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:12:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934320589] [2023-11-23 09:12:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:12:04,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:12:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:12:04,436 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 09:12:04,458 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 09:12:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:04,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-23 09:12:04,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 09:12:04,887 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 43 [2023-11-23 09:12:04,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2023-11-23 09:12:04,916 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-23 09:12:04,916 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2023-11-23 09:12:04,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 09:12:04,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-23 09:12:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 101 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-23 09:12:14,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 09:12:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934320589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:12:15,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 09:12:15,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 35] total 59 [2023-11-23 09:12:15,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293812896] [2023-11-23 09:12:15,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 09:12:15,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-11-23 09:12:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:12:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-11-23 09:12:15,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=4562, Unknown=0, NotChecked=0, Total=4830 [2023-11-23 09:12:15,901 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 59 states, 47 states have (on average 2.276595744680851) internal successors, (107), 47 states have internal predecessors, (107), 19 states have call successors, (36), 7 states have call predecessors, (36), 14 states have return successors, (35), 20 states have call predecessors, (35), 18 states have call successors, (35) [2023-11-23 09:12:22,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 09:12:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:12:27,865 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2023-11-23 09:12:27,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-23 09:12:27,866 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 47 states have (on average 2.276595744680851) internal successors, (107), 47 states have internal predecessors, (107), 19 states have call successors, (36), 7 states have call predecessors, (36), 14 states have return successors, (35), 20 states have call predecessors, (35), 18 states have call successors, (35) Word has length 113 [2023-11-23 09:12:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:12:27,868 INFO L225 Difference]: With dead ends: 146 [2023-11-23 09:12:27,868 INFO L226 Difference]: Without dead ends: 144 [2023-11-23 09:12:27,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 121 SyntacticMatches, 11 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3035 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=744, Invalid=11246, Unknown=0, NotChecked=0, Total=11990 [2023-11-23 09:12:27,872 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 330 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 179 mSolverCounterUnsat, 47 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 47 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-11-23 09:12:27,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 712 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 3029 Invalid, 47 Unknown, 0 Unchecked, 6.7s Time] [2023-11-23 09:12:27,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-23 09:12:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 117. [2023-11-23 09:12:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 25 states have call successors, (25), 15 states have call predecessors, (25), 18 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-11-23 09:12:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2023-11-23 09:12:27,897 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 113 [2023-11-23 09:12:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:12:27,897 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2023-11-23 09:12:27,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 47 states have (on average 2.276595744680851) internal successors, (107), 47 states have internal predecessors, (107), 19 states have call successors, (36), 7 states have call predecessors, (36), 14 states have return successors, (35), 20 states have call predecessors, (35), 18 states have call successors, (35) [2023-11-23 09:12:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2023-11-23 09:12:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 09:12:27,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:12:27,899 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:12:27,912 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 09:12:28,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:12:28,113 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:12:28,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:12:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash -551299843, now seen corresponding path program 1 times [2023-11-23 09:12:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:12:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514969166] [2023-11-23 09:12:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:12:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:12:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:12:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:12:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 09:12:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 09:12:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:12:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 09:12:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 09:12:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:12:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:12:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 09:12:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 09:12:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 09:12:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 09:12:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:12:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-23 09:12:28,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:12:28,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514969166] [2023-11-23 09:12:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514969166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 09:12:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979005835] [2023-11-23 09:12:28,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:12:28,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 09:12:28,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 09:12:28,741 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 09:12:28,742 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 09:12:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:28,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-23 09:12:28,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 09:12:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-23 09:12:29,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 09:12:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-23 09:12:29,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979005835] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 09:12:29,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 09:12:29,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 36 [2023-11-23 09:12:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680564004] [2023-11-23 09:12:29,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 09:12:29,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-23 09:12:29,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:12:29,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-23 09:12:29,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2023-11-23 09:12:29,538 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 36 states, 30 states have (on average 3.2) internal successors, (96), 28 states have internal predecessors, (96), 10 states have call successors, (41), 4 states have call predecessors, (41), 9 states have return successors, (42), 16 states have call predecessors, (42), 9 states have call successors, (42) [2023-11-23 09:12:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:12:30,376 INFO L93 Difference]: Finished difference Result 192 states and 225 transitions. [2023-11-23 09:12:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 09:12:30,377 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 30 states have (on average 3.2) internal successors, (96), 28 states have internal predecessors, (96), 10 states have call successors, (41), 4 states have call predecessors, (41), 9 states have return successors, (42), 16 states have call predecessors, (42), 9 states have call successors, (42) Word has length 113 [2023-11-23 09:12:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:12:30,378 INFO L225 Difference]: With dead ends: 192 [2023-11-23 09:12:30,378 INFO L226 Difference]: Without dead ends: 118 [2023-11-23 09:12:30,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=1873, Unknown=0, NotChecked=0, Total=2070 [2023-11-23 09:12:30,379 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 138 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 09:12:30,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 724 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 09:12:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-23 09:12:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2023-11-23 09:12:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 77 states have internal predecessors, (82), 24 states have call successors, (24), 15 states have call predecessors, (24), 17 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-23 09:12:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2023-11-23 09:12:30,404 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 113 [2023-11-23 09:12:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:12:30,404 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2023-11-23 09:12:30,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 30 states have (on average 3.2) internal successors, (96), 28 states have internal predecessors, (96), 10 states have call successors, (41), 4 states have call predecessors, (41), 9 states have return successors, (42), 16 states have call predecessors, (42), 9 states have call successors, (42) [2023-11-23 09:12:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2023-11-23 09:12:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-23 09:12:30,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:12:30,406 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:30,437 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 09:12:30,619 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,SelfDestructingSolverStorable7 [2023-11-23 09:12:30,619 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:12:30,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:12:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash -614581156, now seen corresponding path program 1 times [2023-11-23 09:12:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:12:30,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366968783] [2023-11-23 09:12:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:12:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:12:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:12:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 09:12:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-23 09:12:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 09:12:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 09:12:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 09:12:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 09:12:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 09:12:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 09:12:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 09:12:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 09:12:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 09:12:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 09:12:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 09:12:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 09:12:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 09:12:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 09:12:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-11-23 09:12:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 09:12:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366968783] [2023-11-23 09:12:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366968783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 09:12:31,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 09:12:31,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 09:12:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244756193] [2023-11-23 09:12:31,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 09:12:31,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 09:12:31,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 09:12:31,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 09:12:31,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-23 09:12:31,329 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 5 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 09:12:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 09:12:31,770 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2023-11-23 09:12:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 09:12:31,771 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 5 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 119 [2023-11-23 09:12:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 09:12:31,774 INFO L225 Difference]: With dead ends: 122 [2023-11-23 09:12:31,775 INFO L226 Difference]: Without dead ends: 118 [2023-11-23 09:12:31,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-11-23 09:12:31,777 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 73 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 09:12:31,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 413 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 09:12:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-23 09:12:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-23 09:12:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 78 states have internal predecessors, (83), 24 states have call successors, (24), 16 states have call predecessors, (24), 17 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-23 09:12:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2023-11-23 09:12:31,799 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 119 [2023-11-23 09:12:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 09:12:31,800 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2023-11-23 09:12:31,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 5 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 09:12:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2023-11-23 09:12:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-23 09:12:31,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 09:12:31,804 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:12:31,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 09:12:31,804 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 09:12:31,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 09:12:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1671499053, now seen corresponding path program 1 times [2023-11-23 09:12:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 09:12:31,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095534238] [2023-11-23 09:12:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 09:12:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 09:12:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 09:12:31,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 09:12:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 09:12:32,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 09:12:32,155 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 09:12:32,156 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 09:12:32,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 09:12:32,159 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 09:12:32,161 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 09:12:32,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated [2023-11-23 09:12:32,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated [2023-11-23 09:12:32,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret540 could not be translated [2023-11-23 09:12:32,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret542 [2023-11-23 09:12:32,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret543 could not be translated [2023-11-23 09:12:32,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ite545 [2023-11-23 09:12:32,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret543 could not be translated [2023-11-23 09:12:32,196 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret1306 [2023-11-23 09:12:32,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated [2023-11-23 09:12:32,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ite1307 [2023-11-23 09:12:32,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated [2023-11-23 09:12:32,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret1306 [2023-11-23 09:12:32,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1308 could not be translated [2023-11-23 09:12:32,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret546 could not be translated [2023-11-23 09:12:32,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret547 [2023-11-23 09:12:32,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem548 could not be translated [2023-11-23 09:12:32,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem548 could not be translated [2023-11-23 09:12:32,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ite1310 [2023-11-23 09:12:32,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1308 could not be translated [2023-11-23 09:12:32,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret1309 [2023-11-23 09:12:32,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated [2023-11-23 09:12:32,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated [2023-11-23 09:12:32,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated [2023-11-23 09:12:32,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem473 could not be translated [2023-11-23 09:12:32,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short474 could not be translated [2023-11-23 09:12:32,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem472 could not be translated [2023-11-23 09:12:32,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated [2023-11-23 09:12:32,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated [2023-11-23 09:12:32,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated [2023-11-23 09:12:32,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated [2023-11-23 09:12:32,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated [2023-11-23 09:12:32,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated [2023-11-23 09:12:32,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated [2023-11-23 09:12:32,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated [2023-11-23 09:12:32,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem735 could not be translated [2023-11-23 09:12:32,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-23 09:12:32,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret736 could not be translated [2023-11-23 09:12:32,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem735 could not be translated [2023-11-23 09:12:32,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated [2023-11-23 09:12:32,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated [2023-11-23 09:12:32,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem473 could not be translated [2023-11-23 09:12:32,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short474 could not be translated [2023-11-23 09:12:32,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem472 could not be translated [2023-11-23 09:12:32,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated [2023-11-23 09:12:32,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated [2023-11-23 09:12:32,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1312 could not be translated [2023-11-23 09:12:32,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1312 could not be translated [2023-11-23 09:12:32,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1313 could not be translated [2023-11-23 09:12:32,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem1315 could not be translated [2023-11-23 09:12:32,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:12:32 BoogieIcfgContainer [2023-11-23 09:12:32,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 09:12:32,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 09:12:32,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 09:12:32,215 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 09:12:32,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:11:55" (3/4) ... [2023-11-23 09:12:32,216 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 09:12:32,223 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated [2023-11-23 09:12:32,224 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated [2023-11-23 09:12:32,224 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret540 could not be translated [2023-11-23 09:12:32,224 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret542 [2023-11-23 09:12:32,224 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret543 could not be translated [2023-11-23 09:12:32,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ite545 [2023-11-23 09:12:32,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret543 could not be translated [2023-11-23 09:12:32,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret1306 [2023-11-23 09:12:32,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated [2023-11-23 09:12:32,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ite1307 [2023-11-23 09:12:32,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret1306 [2023-11-23 09:12:32,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated [2023-11-23 09:12:32,225 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1308 could not be translated [2023-11-23 09:12:32,226 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret546 could not be translated [2023-11-23 09:12:32,226 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret547 [2023-11-23 09:12:32,226 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem548 could not be translated [2023-11-23 09:12:32,226 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem548 could not be translated [2023-11-23 09:12:32,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ite1310 [2023-11-23 09:12:32,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret1309 [2023-11-23 09:12:32,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1308 could not be translated [2023-11-23 09:12:32,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated [2023-11-23 09:12:32,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated [2023-11-23 09:12:32,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated [2023-11-23 09:12:32,227 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem473 could not be translated [2023-11-23 09:12:32,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short474 could not be translated [2023-11-23 09:12:32,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem472 could not be translated [2023-11-23 09:12:32,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated [2023-11-23 09:12:32,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated [2023-11-23 09:12:32,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated [2023-11-23 09:12:32,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated [2023-11-23 09:12:32,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated [2023-11-23 09:12:32,228 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated [2023-11-23 09:12:32,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated [2023-11-23 09:12:32,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated [2023-11-23 09:12:32,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem735 could not be translated [2023-11-23 09:12:32,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-23 09:12:32,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem735 could not be translated [2023-11-23 09:12:32,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret736 could not be translated [2023-11-23 09:12:32,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated [2023-11-23 09:12:32,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated [2023-11-23 09:12:32,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem473 could not be translated [2023-11-23 09:12:32,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short474 could not be translated [2023-11-23 09:12:32,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem472 could not be translated [2023-11-23 09:12:32,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated [2023-11-23 09:12:32,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated [2023-11-23 09:12:32,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1312 could not be translated [2023-11-23 09:12:32,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1312 could not be translated [2023-11-23 09:12:32,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret1313 could not be translated [2023-11-23 09:12:32,231 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem1315 could not be translated [2023-11-23 09:12:32,260 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 09:12:32,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 09:12:32,261 INFO L158 Benchmark]: Toolchain (without parser) took 39333.93ms. Allocated memory was 209.7MB in the beginning and 1.1GB in the end (delta: 878.7MB). Free memory was 133.8MB in the beginning and 642.2MB in the end (delta: -508.5MB). Peak memory consumption was 370.9MB. Max. memory is 16.1GB. [2023-11-23 09:12:32,261 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 09:12:32,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1730.12ms. Allocated memory is still 209.7MB. Free memory was 133.5MB in the beginning and 131.1MB in the end (delta: 2.5MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2023-11-23 09:12:32,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.68ms. Allocated memory is still 209.7MB. Free memory was 131.1MB in the beginning and 151.2MB in the end (delta: -20.2MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2023-11-23 09:12:32,262 INFO L158 Benchmark]: Boogie Preprocessor took 36.88ms. Allocated memory is still 209.7MB. Free memory was 151.2MB in the beginning and 147.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 09:12:32,262 INFO L158 Benchmark]: RCFGBuilder took 669.78ms. Allocated memory is still 209.7MB. Free memory was 147.1MB in the beginning and 94.6MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2023-11-23 09:12:32,262 INFO L158 Benchmark]: TraceAbstraction took 36701.26ms. Allocated memory was 209.7MB in the beginning and 1.1GB in the end (delta: 878.7MB). Free memory was 93.6MB in the beginning and 651.7MB in the end (delta: -558.1MB). Peak memory consumption was 321.7MB. Max. memory is 16.1GB. [2023-11-23 09:12:32,262 INFO L158 Benchmark]: Witness Printer took 45.90ms. Allocated memory is still 1.1GB. Free memory was 650.6MB in the beginning and 642.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-23 09:12:32,263 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 104.9MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1730.12ms. Allocated memory is still 209.7MB. Free memory was 133.5MB in the beginning and 131.1MB in the end (delta: 2.5MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.68ms. Allocated memory is still 209.7MB. Free memory was 131.1MB in the beginning and 151.2MB in the end (delta: -20.2MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.88ms. Allocated memory is still 209.7MB. Free memory was 151.2MB in the beginning and 147.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 669.78ms. Allocated memory is still 209.7MB. Free memory was 147.1MB in the beginning and 94.6MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36701.26ms. Allocated memory was 209.7MB in the beginning and 1.1GB in the end (delta: 878.7MB). Free memory was 93.6MB in the beginning and 651.7MB in the end (delta: -558.1MB). Peak memory consumption was 321.7MB. Max. memory is 16.1GB. * Witness Printer took 45.90ms. Allocated memory is still 1.1GB. Free memory was 650.6MB in the beginning and 642.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8588]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8588] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret540 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret542 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret543 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ite545 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret543 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret1306 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ite1307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret1306 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret546 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret547 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem548 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem548 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ite1310 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret1309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem473 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short474 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem472 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem735 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret736 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem735 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem473 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short474 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem472 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1313 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem1315 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret540 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret542 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret543 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ite545 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret543 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret1306 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ite1307 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret1306 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1305 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret546 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret547 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem548 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem548 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ite1310 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret1309 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1308 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem473 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short474 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem472 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret733 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short734 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem735 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem735 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret736 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem473 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short474 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem472 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short471 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem470 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1312 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret1313 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem1315 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6867-L6872] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7967-L7979] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; [L8924] CALL aws_string_eq_c_str_ignore_case_harness() [L8912] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L8912] RET, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8912-L8913] EXPR nondet_bool() ? ensure_string_is_allocated_bounded_length(16) : ((void *)0) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8912] CALL, EXPR ensure_string_is_allocated_bounded_length(16) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6802] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6802] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=16, max_size=16, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6802] size_t len = nondet_uint64_t(); [L6803] CALL assume_abort_if_not(len < max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6803] RET assume_abort_if_not(len < max_size) VAL [\old(max_size)=16, len=0, max_size=16, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6804] CALL, EXPR ensure_string_is_allocated(len) [L6808] CALL, EXPR bounded_malloc(sizeof(struct aws_string) + len + 1) VAL [\old(size)=17, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6884-L6886] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6884-L6886] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=17, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=17] [L6887] return malloc(size); [L6808] RET, EXPR bounded_malloc(sizeof(struct aws_string) + len + 1) VAL [\old(len)=0, len=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6808] struct aws_string *str = bounded_malloc(sizeof(struct aws_string) + len + 1); [L6811] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L6811] RET, EXPR nondet_bool() VAL [\old(len)=0, len=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6811-L6812] EXPR nondet_bool() ? can_fail_allocator() : ((void *)0) VAL [\old(len)=0, len=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6811-L6812] *(struct aws_allocator **)(&str->allocator) = nondet_bool() ? can_fail_allocator() : ((void *)0) [L6814] *(size_t *)(&str->len) = len [L6815] *(uint8_t *)&str->bytes[len] = '\0' [L6816] return str; [L6804] RET, EXPR ensure_string_is_allocated(len) [L6804] return ensure_string_is_allocated(len); [L8912] RET, EXPR ensure_string_is_allocated_bounded_length(16) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8912-L8913] EXPR nondet_bool() ? ensure_string_is_allocated_bounded_length(16) : ((void *)0) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8912-L8914] struct aws_string *str = nondet_bool() ? ensure_string_is_allocated_bounded_length(16) : ((void *)0) ; [L8915] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L8915] RET, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L8915-L8916] EXPR nondet_bool() ? ensure_c_str_is_allocated(16) : ((void *)0) [L8915] CALL, EXPR ensure_c_str_is_allocated(16) [L6820] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6820] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=16, max_size=16, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6820] size_t cap = nondet_uint64_t(); [L6821] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6821] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=16, cap=1, max_size=16, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6822] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6884-L6886] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6884-L6886] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=1] [L6887] return malloc(size); [L6822] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=16, cap=1, max_size=16, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6822] const char *str = bounded_malloc(cap); [L6826] EXPR str[cap - 1] VAL [\old(max_size)=16, cap=1, max_size=16, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L6826] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6826] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=16, cap=1, max_size=16, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L6827] return str; [L8915] RET, EXPR ensure_c_str_is_allocated(16) [L8915-L8916] EXPR nondet_bool() ? ensure_c_str_is_allocated(16) : ((void *)0) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L8915-L8917] const char *c_str = nondet_bool() ? ensure_c_str_is_allocated(16) : ((void *)0) ; [L8918] CALL, EXPR aws_string_eq_c_str_ignore_case(str, c_str) [L7607] EXPR !str || aws_string_is_valid(str) VAL [c_str={-3:0}, c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L7607] CALL, EXPR aws_string_is_valid(str) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6257] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) [L6257] EXPR str->len [L6257] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L6257] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0 [L6257] EXPR str->len [L6257] EXPR str->bytes[str->len] [L6257] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0 VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L6257] return str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0; [L7607] RET, EXPR aws_string_is_valid(str) VAL [c_str={-3:0}, c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L7607] EXPR !str || aws_string_is_valid(str) VAL [c_str={-3:0}, c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L7607] CALL assume_abort_if_not((!str || aws_string_is_valid(str))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7607] RET assume_abort_if_not((!str || aws_string_is_valid(str))) VAL [c_str={-3:0}, c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L7608-L7611] COND FALSE !(str == ((void *)0) && c_str == ((void *)0)) VAL [c_str={-3:0}, c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L7617-L7620] COND FALSE !(str == ((void *)0) || c_str == ((void *)0)) [L7626] EXPR str->len VAL [c_str={-3:0}, c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L7626] CALL, EXPR aws_array_eq_c_str_ignore_case(str->bytes, str->len, c_str) VAL [\old(array_len)=0, array={-2:16}, c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8044] CALL assume_abort_if_not((array || (array_len == 0))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8044] RET assume_abort_if_not((array || (array_len == 0))) VAL [\old(array_len)=0, array={-2:16}, array={-2:16}, array_len=0, c_str={-3:0}, c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8047-L8049] CALL assume_abort_if_not((c_str != ((void *)0) )) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8047-L8049] RET assume_abort_if_not((c_str != ((void *)0) )) VAL [\old(array_len)=0, array={-2:16}, array={-2:16}, array_len=0, c_str={-3:0}, c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8056] const uint8_t *array_bytes = array; [L8057] const uint8_t *str_bytes = (const uint8_t *)c_str; [L8059] size_t i = 0; VAL [\old(array_len)=0, array={-2:16}, array={-2:16}, array_bytes={-2:16}, array_len=0, c_str={-3:0}, c_str={-3:0}, i=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str_bytes={-3:0}] [L8059] COND FALSE !(i < array_len) VAL [\old(array_len)=0, array={-2:16}, array={-2:16}, array_bytes={-2:16}, array_len=0, c_str={-3:0}, c_str={-3:0}, i=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str_bytes={-3:0}] [L8074] EXPR str_bytes[array_len] [L8074] return str_bytes[array_len] == '\0'; [L7626] RET, EXPR aws_array_eq_c_str_ignore_case(str->bytes, str->len, c_str) VAL [c_str={-3:0}, c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L7626] return aws_array_eq_c_str_ignore_case(str->bytes, str->len, c_str); [L8918] RET, EXPR aws_string_eq_c_str_ignore_case(str, c_str) [L8918] COND TRUE aws_string_eq_c_str_ignore_case(str, c_str) && str && c_str [L8919] CALL, EXPR aws_string_is_valid(str) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6257] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) [L6257] EXPR str->len [L6257] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L6257] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0 [L6257] EXPR str->len [L6257] EXPR str->bytes[str->len] [L6257] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0 VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L6257] return str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0; [L8919] RET, EXPR aws_string_is_valid(str) VAL [c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L8919] CALL __VERIFIER_assert(aws_string_is_valid(str)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8919] RET __VERIFIER_assert(aws_string_is_valid(str)) VAL [c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L8920] CALL, EXPR aws_c_string_is_valid(c_str) [L6272] return str && ((((1)) == 0) || ((str))); [L8920] RET, EXPR aws_c_string_is_valid(c_str) [L8920] CALL __VERIFIER_assert(aws_c_string_is_valid(c_str)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8920] RET __VERIFIER_assert(aws_c_string_is_valid(c_str)) VAL [c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L8921] EXPR str->len VAL [c_str={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L8921] CALL __VERIFIER_assert(str->len == strlen(c_str)) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.6s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 mSolverCounterUnknown, 877 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 811 mSDsluCounter, 3535 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2997 mSDsCounter, 423 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7059 IncrementalHoareTripleChecker+Invalid, 7529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 423 mSolverCounterUnsat, 538 mSDtfsCounter, 7059 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 749 GetRequests, 522 SyntacticMatches, 12 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3336 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=9, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 1055 NumberOfCodeBlocks, 1055 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1031 ConstructedInterpolants, 77 QuantifiedInterpolants, 16183 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1943 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 898/930 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-23 09:12:32,358 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE