./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.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 83ea83276c34d99791c615950bc2829f5984dafaf429e7a88fe36009fea1e8b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:48:41,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:48:41,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 12:48:41,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:48:41,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:48:41,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:48:41,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:48:41,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:48:41,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:48:41,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:48:41,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:48:41,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:48:41,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:48:41,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:48:41,609 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:48:41,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:48:41,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:48:41,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:48:41,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:48:41,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:48:41,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:48:41,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:48:41,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:48:41,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:48:41,612 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:48:41,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:48:41,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:48:41,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:48:41,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:48:41,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:48:41,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:48:41,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:48:41,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:48:41,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:48:41,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:48:41,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:48:41,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:48:41,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:48:41,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:48:41,618 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 -> 83ea83276c34d99791c615950bc2829f5984dafaf429e7a88fe36009fea1e8b3 [2024-10-24 12:48:41,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:48:41,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:48:41,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:48:41,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:48:41,928 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:48:41,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i [2024-10-24 12:48:43,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:48:43,865 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:48:43,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i [2024-10-24 12:48:43,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab85d78f/8f9fb706cdce49e2a0341f2a2c719bb2/FLAG0f17163d3 [2024-10-24 12:48:43,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab85d78f/8f9fb706cdce49e2a0341f2a2c719bb2 [2024-10-24 12:48:43,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:48:43,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:48:43,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:48:43,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:48:43,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:48:43,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:48:43" (1/1) ... [2024-10-24 12:48:43,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350c6ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:43, skipping insertion in model container [2024-10-24 12:48:43,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:48:43" (1/1) ... [2024-10-24 12:48:44,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:48:44,347 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i[4494,4507] [2024-10-24 12:48:44,356 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i[4554,4567] [2024-10-24 12:48:45,091 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,094 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,098 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,099 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,100 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,117 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,119 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,121 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,121 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,540 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,542 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,661 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,665 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:48:45,773 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:48:45,820 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i[4494,4507] [2024-10-24 12:48:45,825 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i[4554,4567] [2024-10-24 12:48:45,869 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,870 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,870 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,871 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,872 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,876 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,877 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,877 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,878 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,975 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:45,976 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:46,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8283] [2024-10-24 12:48:46,028 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:46,029 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:48:46,043 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8769-8780] [2024-10-24 12:48:46,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:48:46,375 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:48:46,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46 WrapperNode [2024-10-24 12:48:46,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:48:46,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:48:46,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:48:46,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:48:46,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,569 INFO L138 Inliner]: procedures = 681, calls = 2608, calls flagged for inlining = 59, calls inlined = 10, statements flattened = 966 [2024-10-24 12:48:46,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:48:46,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:48:46,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:48:46,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:48:46,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,663 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-10-24 12:48:46,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:48:46,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:48:46,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:48:46,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:48:46,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (1/1) ... [2024-10-24 12:48:46,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:48:46,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:48:46,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:48:46,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:48:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2024-10-24 12:48:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2024-10-24 12:48:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 12:48:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-10-24 12:48:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-10-24 12:48:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-24 12:48:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-10-24 12:48:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-10-24 12:48:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 12:48:46,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 12:48:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 12:48:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:48:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-24 12:48:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:48:46,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:48:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-24 12:48:46,861 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-24 12:48:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_realloc [2024-10-24 12:48:46,862 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_realloc [2024-10-24 12:48:46,862 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-10-24 12:48:46,862 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-10-24 12:48:46,862 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_reserve [2024-10-24 12:48:46,862 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_reserve [2024-10-24 12:48:46,862 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2024-10-24 12:48:46,862 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2024-10-24 12:48:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:48:46,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:48:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 12:48:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-24 12:48:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-24 12:48:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-10-24 12:48:46,863 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-10-24 12:48:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-10-24 12:48:46,864 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-10-24 12:48:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-24 12:48:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 12:48:47,180 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:48:47,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:48:48,107 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-24 12:48:48,108 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:48:48,228 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:48:48,229 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-24 12:48:48,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:48:48 BoogieIcfgContainer [2024-10-24 12:48:48,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:48:48,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:48:48,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:48:48,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:48:48,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:48:43" (1/3) ... [2024-10-24 12:48:48,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33932d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:48:48, skipping insertion in model container [2024-10-24 12:48:48,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:48:46" (2/3) ... [2024-10-24 12:48:48,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33932d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:48:48, skipping insertion in model container [2024-10-24 12:48:48,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:48:48" (3/3) ... [2024-10-24 12:48:48,240 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_reserve_harness_negated.i [2024-10-24 12:48:48,257 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:48:48,258 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:48:48,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:48:48,337 INFO L333 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, 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;@2dc3be11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:48:48,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:48:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 12:48:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 12:48:48,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:48:48,354 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:48:48,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:48:48,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:48:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 250891708, now seen corresponding path program 1 times [2024-10-24 12:48:48,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:48:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817711718] [2024-10-24 12:48:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:48,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:48:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:49,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:49,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:48:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:49,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:48:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 12:48:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:49,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 12:48:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 12:48:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 12:48:49,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:48:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817711718] [2024-10-24 12:48:49,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817711718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:48:49,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:48:49,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:48:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718863342] [2024-10-24 12:48:49,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:48:49,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:48:49,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:48:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:48:49,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:48:49,176 INFO L87 Difference]: Start difference. First operand has 143 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 12:48:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:48:49,693 INFO L93 Difference]: Finished difference Result 298 states and 433 transitions. [2024-10-24 12:48:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:48:49,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2024-10-24 12:48:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:48:49,707 INFO L225 Difference]: With dead ends: 298 [2024-10-24 12:48:49,708 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 12:48:49,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:48:49,722 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 84 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:48:49,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 159 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:48:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 12:48:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 139. [2024-10-24 12:48:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 89 states have internal predecessors, (111), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 12:48:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 186 transitions. [2024-10-24 12:48:49,790 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 186 transitions. Word has length 46 [2024-10-24 12:48:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:48:49,791 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 186 transitions. [2024-10-24 12:48:49,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 12:48:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 186 transitions. [2024-10-24 12:48:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 12:48:49,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:48:49,795 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:48:49,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:48:49,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:48:49,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:48:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1214584568, now seen corresponding path program 1 times [2024-10-24 12:48:49,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:48:49,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090006249] [2024-10-24 12:48:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:49,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:48:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:50,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:48:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:50,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:48:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:50,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 12:48:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 12:48:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:50,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 12:48:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 12:48:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:48:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:48:50,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090006249] [2024-10-24 12:48:50,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090006249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:48:50,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:48:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:48:50,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548442207] [2024-10-24 12:48:50,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:48:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:48:50,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:48:50,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:48:50,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:48:50,584 INFO L87 Difference]: Start difference. First operand 139 states and 186 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 12:48:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:48:51,569 INFO L93 Difference]: Finished difference Result 310 states and 427 transitions. [2024-10-24 12:48:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:48:51,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 47 [2024-10-24 12:48:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:48:51,573 INFO L225 Difference]: With dead ends: 310 [2024-10-24 12:48:51,574 INFO L226 Difference]: Without dead ends: 184 [2024-10-24 12:48:51,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:48:51,576 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 208 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 12:48:51,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 323 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 12:48:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-24 12:48:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 141. [2024-10-24 12:48:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 91 states have internal predecessors, (112), 38 states have call successors, (38), 12 states have call predecessors, (38), 13 states have return successors, (41), 37 states have call predecessors, (41), 37 states have call successors, (41) [2024-10-24 12:48:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 191 transitions. [2024-10-24 12:48:51,600 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 191 transitions. Word has length 47 [2024-10-24 12:48:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:48:51,600 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 191 transitions. [2024-10-24 12:48:51,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 12:48:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 191 transitions. [2024-10-24 12:48:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 12:48:51,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:48:51,602 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:48:51,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:48:51,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:48:51,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:48:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1231457379, now seen corresponding path program 1 times [2024-10-24 12:48:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:48:51,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989441832] [2024-10-24 12:48:51,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:48:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:48:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:52,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:48:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:52,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 12:48:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 12:48:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:52,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 12:48:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 12:48:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:48:52,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:48:52,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989441832] [2024-10-24 12:48:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989441832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:48:52,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:48:52,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:48:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315453001] [2024-10-24 12:48:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:48:52,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:48:52,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:48:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:48:52,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:48:52,132 INFO L87 Difference]: Start difference. First operand 141 states and 191 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 12:48:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:48:53,194 INFO L93 Difference]: Finished difference Result 247 states and 332 transitions. [2024-10-24 12:48:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 12:48:53,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 53 [2024-10-24 12:48:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:48:53,197 INFO L225 Difference]: With dead ends: 247 [2024-10-24 12:48:53,197 INFO L226 Difference]: Without dead ends: 194 [2024-10-24 12:48:53,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:48:53,199 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 263 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:48:53,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 445 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 12:48:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-24 12:48:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 145. [2024-10-24 12:48:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 92 states have (on average 1.25) internal successors, (115), 94 states have internal predecessors, (115), 38 states have call successors, (38), 12 states have call predecessors, (38), 14 states have return successors, (42), 38 states have call predecessors, (42), 37 states have call successors, (42) [2024-10-24 12:48:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 195 transitions. [2024-10-24 12:48:53,218 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 195 transitions. Word has length 53 [2024-10-24 12:48:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:48:53,218 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 195 transitions. [2024-10-24 12:48:53,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 12:48:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 195 transitions. [2024-10-24 12:48:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 12:48:53,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:48:53,220 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 12:48:53,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:48:53,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:48:53,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:48:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1937851488, now seen corresponding path program 1 times [2024-10-24 12:48:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:48:53,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656096422] [2024-10-24 12:48:53,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:53,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:48:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:53,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:48:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:48:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 12:48:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:53,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 12:48:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:53,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 12:48:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:48:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 12:48:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 12:48:53,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:48:53,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656096422] [2024-10-24 12:48:53,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656096422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:48:53,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:48:53,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:48:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184136024] [2024-10-24 12:48:53,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:48:53,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:48:53,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:48:53,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:48:53,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:48:53,905 INFO L87 Difference]: Start difference. First operand 145 states and 195 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-24 12:48:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:48:55,048 INFO L93 Difference]: Finished difference Result 346 states and 484 transitions. [2024-10-24 12:48:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 12:48:55,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 60 [2024-10-24 12:48:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:48:55,051 INFO L225 Difference]: With dead ends: 346 [2024-10-24 12:48:55,051 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 12:48:55,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-10-24 12:48:55,053 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 446 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 12:48:55,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 356 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 12:48:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 12:48:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 188. [2024-10-24 12:48:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 126 states have internal predecessors, (157), 50 states have call successors, (50), 13 states have call predecessors, (50), 15 states have return successors, (54), 48 states have call predecessors, (54), 46 states have call successors, (54) [2024-10-24 12:48:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 261 transitions. [2024-10-24 12:48:55,079 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 261 transitions. Word has length 60 [2024-10-24 12:48:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:48:55,080 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 261 transitions. [2024-10-24 12:48:55,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-24 12:48:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 261 transitions. [2024-10-24 12:48:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 12:48:55,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:48:55,082 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 12:48:55,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:48:55,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:48:55,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:48:55,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1704324954, now seen corresponding path program 1 times [2024-10-24 12:48:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:48:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891971418] [2024-10-24 12:48:55,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:48:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:55,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:48:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:55,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:48:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:55,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 12:48:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:55,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 12:48:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:55,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:48:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 12:48:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 12:48:55,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:48:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891971418] [2024-10-24 12:48:55,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891971418] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:48:55,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562262002] [2024-10-24 12:48:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:55,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:48:55,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:48:55,575 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) [2024-10-24 12:48:55,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 12:48:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:56,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:48:56,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:48:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 12:48:56,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:48:56,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562262002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:48:56,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:48:56,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-10-24 12:48:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940188965] [2024-10-24 12:48:56,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:48:56,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:48:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:48:56,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:48:56,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:48:56,182 INFO L87 Difference]: Start difference. First operand 188 states and 261 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 12:48:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:48:56,463 INFO L93 Difference]: Finished difference Result 225 states and 301 transitions. [2024-10-24 12:48:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:48:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 60 [2024-10-24 12:48:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:48:56,465 INFO L225 Difference]: With dead ends: 225 [2024-10-24 12:48:56,466 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 12:48:56,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:48:56,468 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 75 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:48:56,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 680 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:48:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 12:48:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-10-24 12:48:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 92 states have internal predecessors, (113), 38 states have call successors, (38), 12 states have call predecessors, (38), 13 states have return successors, (38), 38 states have call predecessors, (38), 37 states have call successors, (38) [2024-10-24 12:48:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 189 transitions. [2024-10-24 12:48:56,498 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 189 transitions. Word has length 60 [2024-10-24 12:48:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:48:56,498 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 189 transitions. [2024-10-24 12:48:56,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 12:48:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 189 transitions. [2024-10-24 12:48:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 12:48:56,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:48:56,500 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:48:56,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:48:56,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:48:56,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:48:56,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:48:56,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2107969405, now seen corresponding path program 1 times [2024-10-24 12:48:56,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:48:56,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156180774] [2024-10-24 12:48:56,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:48:56,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:48:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:57,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:57,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:48:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:48:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:58,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:48:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:58,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 12:48:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:58,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 12:48:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:58,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 12:48:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:58,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 12:48:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 12:48:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:48:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 12:48:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:48:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156180774] [2024-10-24 12:48:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156180774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:48:58,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:48:58,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 12:48:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300275731] [2024-10-24 12:48:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:48:58,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 12:48:58,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:48:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 12:48:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:48:58,317 INFO L87 Difference]: Start difference. First operand 143 states and 189 transitions. Second operand has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-24 12:49:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:00,023 INFO L93 Difference]: Finished difference Result 365 states and 508 transitions. [2024-10-24 12:49:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 12:49:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 64 [2024-10-24 12:49:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:00,028 INFO L225 Difference]: With dead ends: 365 [2024-10-24 12:49:00,028 INFO L226 Difference]: Without dead ends: 235 [2024-10-24 12:49:00,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2024-10-24 12:49:00,031 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 178 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:00,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 594 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 12:49:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-24 12:49:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 174. [2024-10-24 12:49:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 114 states have internal predecessors, (136), 45 states have call successors, (45), 12 states have call predecessors, (45), 17 states have return successors, (54), 47 states have call predecessors, (54), 44 states have call successors, (54) [2024-10-24 12:49:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2024-10-24 12:49:00,074 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 64 [2024-10-24 12:49:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:00,074 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2024-10-24 12:49:00,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-24 12:49:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2024-10-24 12:49:00,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 12:49:00,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:00,077 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:00,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:49:00,077 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:00,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:00,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1779050675, now seen corresponding path program 1 times [2024-10-24 12:49:00,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:49:00,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015633878] [2024-10-24 12:49:00,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:00,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:49:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:00,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:49:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:49:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:00,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 12:49:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:00,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 12:49:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:00,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:49:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:00,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 12:49:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:00,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:49:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 12:49:00,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:49:00,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015633878] [2024-10-24 12:49:00,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015633878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:00,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:49:00,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:49:00,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125437456] [2024-10-24 12:49:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:00,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:49:00,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:49:00,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:49:00,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:49:00,509 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 12:49:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:01,595 INFO L93 Difference]: Finished difference Result 283 states and 378 transitions. [2024-10-24 12:49:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 12:49:01,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-24 12:49:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:01,597 INFO L225 Difference]: With dead ends: 283 [2024-10-24 12:49:01,598 INFO L226 Difference]: Without dead ends: 229 [2024-10-24 12:49:01,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:49:01,599 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 117 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:01,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 483 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 12:49:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-24 12:49:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 174. [2024-10-24 12:49:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 114 states have internal predecessors, (136), 45 states have call successors, (45), 12 states have call predecessors, (45), 17 states have return successors, (54), 47 states have call predecessors, (54), 44 states have call successors, (54) [2024-10-24 12:49:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2024-10-24 12:49:01,620 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 70 [2024-10-24 12:49:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:01,621 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2024-10-24 12:49:01,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 12:49:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2024-10-24 12:49:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 12:49:01,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:01,622 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:01,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:49:01,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:01,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash 877162115, now seen corresponding path program 1 times [2024-10-24 12:49:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:49:01,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358011382] [2024-10-24 12:49:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:49:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:02,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:02,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:49:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:02,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:49:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:02,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 12:49:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:02,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 12:49:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:02,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 12:49:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:02,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 12:49:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:02,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 12:49:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 12:49:02,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:49:02,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358011382] [2024-10-24 12:49:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358011382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:49:02,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225864519] [2024-10-24 12:49:02,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:02,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:49:02,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:49:02,852 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) [2024-10-24 12:49:02,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 12:49:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:03,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 2503 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 12:49:03,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:49:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 12:49:03,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:49:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225864519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:49:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 14 [2024-10-24 12:49:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938930424] [2024-10-24 12:49:03,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:03,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:49:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:49:03,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:49:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:49:03,366 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 12:49:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:03,794 INFO L93 Difference]: Finished difference Result 339 states and 463 transitions. [2024-10-24 12:49:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:49:03,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2024-10-24 12:49:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:03,796 INFO L225 Difference]: With dead ends: 339 [2024-10-24 12:49:03,796 INFO L226 Difference]: Without dead ends: 178 [2024-10-24 12:49:03,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:49:03,798 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:03,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1313 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:49:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-24 12:49:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-10-24 12:49:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 114 states have (on average 1.219298245614035) internal successors, (139), 118 states have internal predecessors, (139), 45 states have call successors, (45), 12 states have call predecessors, (45), 18 states have return successors, (61), 47 states have call predecessors, (61), 44 states have call successors, (61) [2024-10-24 12:49:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 245 transitions. [2024-10-24 12:49:03,817 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 245 transitions. Word has length 72 [2024-10-24 12:49:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:03,817 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 245 transitions. [2024-10-24 12:49:03,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 12:49:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 245 transitions. [2024-10-24 12:49:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 12:49:03,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:03,818 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:03,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 12:49:04,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-24 12:49:04,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:04,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash 888931528, now seen corresponding path program 1 times [2024-10-24 12:49:04,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:49:04,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192575563] [2024-10-24 12:49:04,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:04,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:49:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:04,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:04,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:49:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:04,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:04,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:49:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:04,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 12:49:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:04,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 12:49:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:04,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 12:49:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:05,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 12:49:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:05,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 12:49:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 12:49:05,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:49:05,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192575563] [2024-10-24 12:49:05,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192575563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:05,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:49:05,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:49:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965145190] [2024-10-24 12:49:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:05,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:49:05,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:49:05,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:49:05,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:49:05,106 INFO L87 Difference]: Start difference. First operand 178 states and 245 transitions. Second operand has 12 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 12:49:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:06,688 INFO L93 Difference]: Finished difference Result 233 states and 329 transitions. [2024-10-24 12:49:06,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 12:49:06,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-10-24 12:49:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:06,693 INFO L225 Difference]: With dead ends: 233 [2024-10-24 12:49:06,693 INFO L226 Difference]: Without dead ends: 231 [2024-10-24 12:49:06,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-10-24 12:49:06,694 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 123 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:06,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 696 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 12:49:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-24 12:49:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 183. [2024-10-24 12:49:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 121 states have internal predecessors, (142), 46 states have call successors, (46), 13 states have call predecessors, (46), 19 states have return successors, (62), 48 states have call predecessors, (62), 45 states have call successors, (62) [2024-10-24 12:49:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 250 transitions. [2024-10-24 12:49:06,720 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 250 transitions. Word has length 74 [2024-10-24 12:49:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:06,721 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 250 transitions. [2024-10-24 12:49:06,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 12:49:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2024-10-24 12:49:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 12:49:06,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:06,724 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:06,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:49:06,724 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:06,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:06,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1539636829, now seen corresponding path program 1 times [2024-10-24 12:49:06,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:49:06,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108641523] [2024-10-24 12:49:06,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:06,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:49:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:49:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:49:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 12:49:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 12:49:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 12:49:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 12:49:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 12:49:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 12:49:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:49:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108641523] [2024-10-24 12:49:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108641523] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:49:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665578229] [2024-10-24 12:49:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:07,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:49:07,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:49:07,522 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:49:07,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 12:49:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:07,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:49:08,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:49:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 12:49:08,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:49:08,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665578229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:08,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:49:08,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2024-10-24 12:49:08,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449233981] [2024-10-24 12:49:08,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:08,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:49:08,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:49:08,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:49:08,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:49:08,103 INFO L87 Difference]: Start difference. First operand 183 states and 250 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 12:49:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:08,685 INFO L93 Difference]: Finished difference Result 373 states and 544 transitions. [2024-10-24 12:49:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:49:08,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2024-10-24 12:49:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:08,688 INFO L225 Difference]: With dead ends: 373 [2024-10-24 12:49:08,688 INFO L226 Difference]: Without dead ends: 203 [2024-10-24 12:49:08,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:49:08,690 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 14 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:08,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 602 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:49:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-24 12:49:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 188. [2024-10-24 12:49:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 122 states have (on average 1.221311475409836) internal successors, (149), 126 states have internal predecessors, (149), 46 states have call successors, (46), 13 states have call predecessors, (46), 19 states have return successors, (62), 48 states have call predecessors, (62), 45 states have call successors, (62) [2024-10-24 12:49:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 257 transitions. [2024-10-24 12:49:08,708 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 257 transitions. Word has length 76 [2024-10-24 12:49:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:08,708 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 257 transitions. [2024-10-24 12:49:08,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 12:49:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 257 transitions. [2024-10-24 12:49:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 12:49:08,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:08,709 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:08,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 12:49:08,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:49:08,910 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:08,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash -588102813, now seen corresponding path program 1 times [2024-10-24 12:49:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:49:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833231047] [2024-10-24 12:49:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:49:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:49:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:49:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 12:49:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 12:49:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 12:49:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 12:49:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 12:49:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 12:49:09,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:49:09,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833231047] [2024-10-24 12:49:09,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833231047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:49:09,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015612107] [2024-10-24 12:49:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:49:09,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:49:09,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:49:09,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 12:49:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:09,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 2503 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 12:49:09,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:49:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 12:49:09,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:49:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015612107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:09,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:49:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2024-10-24 12:49:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134400989] [2024-10-24 12:49:09,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:09,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:49:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:49:09,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:49:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:49:09,837 INFO L87 Difference]: Start difference. First operand 188 states and 257 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 12:49:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:10,026 INFO L93 Difference]: Finished difference Result 365 states and 511 transitions. [2024-10-24 12:49:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:49:10,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2024-10-24 12:49:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:10,029 INFO L225 Difference]: With dead ends: 365 [2024-10-24 12:49:10,029 INFO L226 Difference]: Without dead ends: 190 [2024-10-24 12:49:10,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:49:10,030 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:10,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 508 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:49:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-24 12:49:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-24 12:49:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 124 states have (on average 1.217741935483871) internal successors, (151), 128 states have internal predecessors, (151), 46 states have call successors, (46), 13 states have call predecessors, (46), 19 states have return successors, (62), 48 states have call predecessors, (62), 45 states have call successors, (62) [2024-10-24 12:49:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 259 transitions. [2024-10-24 12:49:10,048 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 259 transitions. Word has length 76 [2024-10-24 12:49:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:10,048 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 259 transitions. [2024-10-24 12:49:10,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 12:49:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 259 transitions. [2024-10-24 12:49:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 12:49:10,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:10,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:10,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 12:49:10,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:49:10,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:10,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2022103011, now seen corresponding path program 1 times [2024-10-24 12:49:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:49:10,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88472914] [2024-10-24 12:49:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:49:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:10,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:10,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:49:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:10,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:49:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:10,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:49:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:10,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 12:49:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:10,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 12:49:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:10,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 12:49:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:10,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 12:49:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:10,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 12:49:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 12:49:10,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:49:10,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88472914] [2024-10-24 12:49:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88472914] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:49:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315037363] [2024-10-24 12:49:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:10,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:49:10,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:49:10,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:49:10,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 12:49:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:11,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 2507 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 12:49:11,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:49:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 12:49:11,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:49:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315037363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:11,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:49:11,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2024-10-24 12:49:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975298954] [2024-10-24 12:49:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:11,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:49:11,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:49:11,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:49:11,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:49:11,027 INFO L87 Difference]: Start difference. First operand 190 states and 259 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 12:49:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:11,220 INFO L93 Difference]: Finished difference Result 368 states and 526 transitions. [2024-10-24 12:49:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:49:11,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2024-10-24 12:49:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:11,224 INFO L225 Difference]: With dead ends: 368 [2024-10-24 12:49:11,224 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 12:49:11,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:49:11,226 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:11,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:49:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 12:49:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2024-10-24 12:49:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 124 states have (on average 1.2096774193548387) internal successors, (150), 128 states have internal predecessors, (150), 46 states have call successors, (46), 13 states have call predecessors, (46), 19 states have return successors, (62), 48 states have call predecessors, (62), 45 states have call successors, (62) [2024-10-24 12:49:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2024-10-24 12:49:11,244 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 76 [2024-10-24 12:49:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:11,244 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2024-10-24 12:49:11,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 12:49:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2024-10-24 12:49:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 12:49:11,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:11,246 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:11,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 12:49:11,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-24 12:49:11,447 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:11,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:11,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1907147229, now seen corresponding path program 1 times [2024-10-24 12:49:11,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:49:11,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879778366] [2024-10-24 12:49:11,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:11,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:49:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:49:11,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:49:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:49:11,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:49:11,895 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:49:11,896 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 12:49:11,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 12:49:11,900 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:11,993 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 12:49:11,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:49:11 BoogieIcfgContainer [2024-10-24 12:49:11,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 12:49:11,996 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 12:49:11,997 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 12:49:11,997 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 12:49:11,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:48:48" (3/4) ... [2024-10-24 12:49:11,999 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 12:49:12,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 12:49:12,001 INFO L158 Benchmark]: Toolchain (without parser) took 28073.95ms. Allocated memory was 140.5MB in the beginning and 650.1MB in the end (delta: 509.6MB). Free memory was 77.3MB in the beginning and 393.2MB in the end (delta: -315.9MB). Peak memory consumption was 196.8MB. Max. memory is 16.1GB. [2024-10-24 12:49:12,001 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 140.5MB. Free memory is still 112.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 12:49:12,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2447.59ms. Allocated memory was 140.5MB in the beginning and 260.0MB in the end (delta: 119.5MB). Free memory was 77.1MB in the beginning and 173.1MB in the end (delta: -96.1MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. [2024-10-24 12:49:12,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 192.26ms. Allocated memory is still 260.0MB. Free memory was 173.1MB in the beginning and 160.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 12:49:12,002 INFO L158 Benchmark]: Boogie Preprocessor took 180.62ms. Allocated memory is still 260.0MB. Free memory was 160.6MB in the beginning and 145.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 12:49:12,002 INFO L158 Benchmark]: RCFGBuilder took 1477.64ms. Allocated memory is still 260.0MB. Free memory was 145.9MB in the beginning and 75.3MB in the end (delta: 70.6MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-10-24 12:49:12,003 INFO L158 Benchmark]: TraceAbstraction took 23764.33ms. Allocated memory was 260.0MB in the beginning and 650.1MB in the end (delta: 390.1MB). Free memory was 74.3MB in the beginning and 394.3MB in the end (delta: -320.0MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2024-10-24 12:49:12,003 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 650.1MB. Free memory was 394.3MB in the beginning and 393.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 12:49:12,005 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.18ms. Allocated memory is still 140.5MB. Free memory is still 112.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2447.59ms. Allocated memory was 140.5MB in the beginning and 260.0MB in the end (delta: 119.5MB). Free memory was 77.1MB in the beginning and 173.1MB in the end (delta: -96.1MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 192.26ms. Allocated memory is still 260.0MB. Free memory was 173.1MB in the beginning and 160.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 180.62ms. Allocated memory is still 260.0MB. Free memory was 160.6MB in the beginning and 145.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1477.64ms. Allocated memory is still 260.0MB. Free memory was 145.9MB in the beginning and 75.3MB in the end (delta: 70.6MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23764.33ms. Allocated memory was 260.0MB in the beginning and 650.1MB in the end (delta: 390.1MB). Free memory was 74.3MB in the beginning and 394.3MB in the end (delta: -320.0MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 650.1MB. Free memory was 394.3MB in the beginning and 393.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8283]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8283] - GenericResultAtLocation [Line: 8769]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8769-8780] * 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 - UnprovableResult [Line: 223]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of large string literal at line 8786. Possible FailurePath: [L6854-L6859] 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, }; [L7279] static __thread int tl_last_error = 0; [L7662-L7674] 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}; [L8785-L8933] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L8936-L8939] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L8941-L8950] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L8952-L8955] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L8957-L8961] static _Bool s_common_library_initialized = 0 ; [L8993] CALL aws_byte_buf_reserve_harness() [L8974] struct aws_byte_buf buf = {__VERIFIER_nondet_ulong(), 0, __VERIFIER_nondet_ulong(), 0}; [L8974] struct aws_byte_buf buf = {__VERIFIER_nondet_ulong(), 0, __VERIFIER_nondet_ulong(), 0}; [L8974] struct aws_byte_buf buf = {__VERIFIER_nondet_ulong(), 0, __VERIFIER_nondet_ulong(), 0}; [L8975] CALL ensure_byte_buf_has_allocated_buffer_member(&buf) [L6598] CALL, EXPR nondet_bool() VAL [errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L261] return __VERIFIER_nondet_bool(); [L6598] RET, EXPR nondet_bool() VAL [buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L6598-L6600] EXPR (nondet_bool()) ? ((void *)0) : can_fail_allocator() VAL [buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L6598-L6600] buf->allocator = (nondet_bool()) ? ((void *)0) : can_fail_allocator() [L6601] EXPR buf->capacity VAL [buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L6601] CALL, EXPR bounded_malloc(sizeof(*(buf->buffer)) * buf->capacity) VAL [\old(size)=-(((__int128) 0 << 64) | 18446744073709551615U), errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L6871-L6873] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L6871-L6873] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=-(((__int128) 0 << 64) | 18446744073709551615U), errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, size=-(((__int128) 0 << 64) | 18446744073709551615U), tl_last_error=0] [L6874] return malloc(size); [L6601] RET, EXPR bounded_malloc(sizeof(*(buf->buffer)) * buf->capacity) VAL [buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L6601] buf->buffer = bounded_malloc(sizeof(*(buf->buffer)) * buf->capacity) [L8975] RET ensure_byte_buf_has_allocated_buffer_member(&buf) [L8976] CALL, EXPR aws_byte_buf_is_valid(&buf) VAL [\old(buf)={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L7391-L7394] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7391] EXPR buf->capacity [L7391] EXPR buf->capacity == 0 && buf->len == 0 VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L7391-L7392] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L7391-L7394] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) [L7394] EXPR buf->capacity [L7394] EXPR buf->capacity > 0 && buf->len <= buf->capacity [L7394] EXPR buf->len [L7394] EXPR buf->capacity [L7394] EXPR buf->capacity > 0 && buf->len <= buf->capacity VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L7394] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) [L7394] EXPR buf->len [L7394] EXPR (((buf->len)) == 0) || ((buf->buffer)) VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L7394] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L7391-L7394] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L7391-L7394] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L7391-L7394] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L8976] RET, EXPR aws_byte_buf_is_valid(&buf) VAL [buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L8976] CALL assume_abort_if_not(aws_byte_buf_is_valid(&buf)) VAL [\old(cond)=1, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L8976] RET assume_abort_if_not(aws_byte_buf_is_valid(&buf)) VAL [buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L8978] struct aws_byte_buf old = buf; VAL [buf={258:0}, errors={194:0}, old={257:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L8979] CALL, EXPR nondet_size_t() VAL [errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L263] return __VERIFIER_nondet_ulong(); [L8979] RET, EXPR nondet_size_t() VAL [buf={258:0}, errors={194:0}, old={257:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L8979] size_t requested_capacity = nondet_size_t(); [L8981] CALL, EXPR aws_byte_buf_reserve(&buf, requested_capacity) VAL [\old(tl_last_error)=0, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L8034] EXPR buffer->allocator VAL [\old(buffer)={258:0}, \old(requested_capacity)=1073741827, \old(tl_last_error)=0, buffer={258:0}, errors={194:0}, requested_capacity=1073741827, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L8034] COND TRUE !(buffer->allocator) [L8034] CALL, EXPR aws_raise_error(AWS_ERROR_INVALID_ARGUMENT) VAL [\old(tl_last_error)=0, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=0] [L1996] CALL aws_raise_error_private(err) [L7286] tl_last_error = err [L1996] RET aws_raise_error_private(err) [L1998] return (-1); [L8034] RET, EXPR aws_raise_error(AWS_ERROR_INVALID_ARGUMENT) VAL [\old(buffer)={258:0}, \old(requested_capacity)=1073741827, \old(tl_last_error)=0, buffer={258:0}, errors={194:0}, requested_capacity=1073741827, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L8034] return aws_raise_error(AWS_ERROR_INVALID_ARGUMENT); [L8981] RET, EXPR aws_byte_buf_reserve(&buf, requested_capacity) VAL [buf={258:0}, errors={194:0}, old={257:0}, requested_capacity=1073741827, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L8981] COND FALSE !(aws_byte_buf_reserve(&buf, requested_capacity) == (0)) [L8986] CALL, EXPR aws_byte_buf_is_valid(&buf) VAL [\old(buf)={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L7391-L7394] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7391] EXPR buf->capacity [L7391] EXPR buf->capacity == 0 && buf->len == 0 VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L7391-L7392] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L7391-L7394] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) [L7394] EXPR buf->capacity [L7394] EXPR buf->capacity > 0 && buf->len <= buf->capacity [L7394] EXPR buf->len [L7394] EXPR buf->capacity [L7394] EXPR buf->capacity > 0 && buf->len <= buf->capacity VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L7394] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) [L7394] EXPR buf->len [L7394] EXPR (((buf->len)) == 0) || ((buf->buffer)) VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L7394] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L7391-L7394] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L7391-L7394] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [\old(buf)={258:0}, buf={258:0}, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L7391-L7394] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L8986] RET, EXPR aws_byte_buf_is_valid(&buf) VAL [buf={258:0}, errors={194:0}, old={257:0}, requested_capacity=1073741827, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L8986] CALL __VERIFIER_assert(!(aws_byte_buf_is_valid(&buf))) VAL [\old(cond)=0, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L223] COND TRUE !cond VAL [\old(cond)=0, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] [L223] reach_error() VAL [\old(cond)=0, errors={194:0}, s_can_fail_allocator_static={192:0}, s_common_library_initialized=0, s_common_log_subject_infos={195:0}, s_tolower_table={193:0}, tl_last_error=33] - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1705 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1509 mSDsluCounter, 6673 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5188 mSDsCounter, 992 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5835 IncrementalHoareTripleChecker+Invalid, 6827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 992 mSolverCounterUnsat, 1485 mSDtfsCounter, 5835 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 543 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=11, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 365 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1210 NumberOfCodeBlocks, 1210 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1117 ConstructedInterpolants, 1 QuantifiedInterpolants, 2074 SizeOfPredicates, 7 NumberOfNonLiveVariables, 12485 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 216/258 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 could not prove your program: unable to determine feasibility of some traces [2024-10-24 12:49:12,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 83ea83276c34d99791c615950bc2829f5984dafaf429e7a88fe36009fea1e8b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:49:14,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:49:14,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 12:49:14,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:49:14,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:49:14,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:49:14,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:49:14,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:49:14,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:49:14,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:49:14,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:49:14,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:49:14,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:49:14,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:49:14,393 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:49:14,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:49:14,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:49:14,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:49:14,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:49:14,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:49:14,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:49:14,397 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 12:49:14,397 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 12:49:14,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:49:14,398 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 12:49:14,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:49:14,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:49:14,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:49:14,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:49:14,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:49:14,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:49:14,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:49:14,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:49:14,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:49:14,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:49:14,402 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 12:49:14,402 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 12:49:14,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:49:14,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:49:14,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:49:14,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:49:14,404 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 12:49:14,404 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 -> 83ea83276c34d99791c615950bc2829f5984dafaf429e7a88fe36009fea1e8b3 [2024-10-24 12:49:14,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:49:14,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:49:14,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:49:14,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:49:14,764 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:49:14,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i [2024-10-24 12:49:16,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:49:16,785 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:49:16,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i [2024-10-24 12:49:16,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b9241e5/30c4ae59643e4a2cb7a9789f02784eeb/FLAG9a69688b9 [2024-10-24 12:49:16,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b9241e5/30c4ae59643e4a2cb7a9789f02784eeb [2024-10-24 12:49:16,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:49:16,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:49:16,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:49:16,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:49:16,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:49:16,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:49:16" (1/1) ... [2024-10-24 12:49:16,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7672a411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:16, skipping insertion in model container [2024-10-24 12:49:16,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:49:16" (1/1) ... [2024-10-24 12:49:16,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:49:17,231 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i[4494,4507] [2024-10-24 12:49:17,239 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i[4554,4567] [2024-10-24 12:49:18,158 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,163 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,163 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,164 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,164 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,182 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,184 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,185 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,187 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,744 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,745 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,830 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,831 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:18,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:49:18,968 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 12:49:19,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:49:19,022 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i[4494,4507] [2024-10-24 12:49:19,023 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i[4554,4567] [2024-10-24 12:49:19,052 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,054 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,054 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,054 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,055 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,062 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,066 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,067 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,068 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,163 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,167 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,207 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,208 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:49:19,283 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:49:19,298 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i[4494,4507] [2024-10-24 12:49:19,302 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness_negated.i[4554,4567] [2024-10-24 12:49:19,334 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,335 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,335 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,335 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,336 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,343 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,344 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,349 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,349 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,422 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,432 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8283] [2024-10-24 12:49:19,516 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,517 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:49:19,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8769-8780] [2024-10-24 12:49:19,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:49:19,841 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:49:19,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19 WrapperNode [2024-10-24 12:49:19,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:49:19,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:49:19,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:49:19,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:49:19,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:19,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,042 INFO L138 Inliner]: procedures = 701, calls = 2608, calls flagged for inlining = 59, calls inlined = 10, statements flattened = 961 [2024-10-24 12:49:20,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:49:20,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:49:20,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:49:20,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:49:20,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,132 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-10-24 12:49:20,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:49:20,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:49:20,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:49:20,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:49:20,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (1/1) ... [2024-10-24 12:49:20,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:49:20,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:49:20,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:49:20,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:49:20,342 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2024-10-24 12:49:20,343 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2024-10-24 12:49:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 12:49:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-10-24 12:49:20,343 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-10-24 12:49:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-24 12:49:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-24 12:49:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2024-10-24 12:49:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-10-24 12:49:20,344 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-10-24 12:49:20,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 12:49:20,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 12:49:20,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 12:49:20,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:49:20,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-24 12:49:20,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:49:20,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:49:20,347 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-24 12:49:20,347 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-24 12:49:20,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-10-24 12:49:20,347 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_realloc [2024-10-24 12:49:20,347 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_realloc [2024-10-24 12:49:20,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2024-10-24 12:49:20,347 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-10-24 12:49:20,347 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-10-24 12:49:20,348 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_reserve [2024-10-24 12:49:20,348 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_reserve [2024-10-24 12:49:20,348 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2024-10-24 12:49:20,348 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2024-10-24 12:49:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:49:20,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:49:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 12:49:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-24 12:49:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2024-10-24 12:49:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-24 12:49:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-10-24 12:49:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-10-24 12:49:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-10-24 12:49:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-10-24 12:49:20,667 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:49:20,670 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:49:22,045 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-24 12:49:22,045 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:49:22,293 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:49:22,294 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-24 12:49:22,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:49:22 BoogieIcfgContainer [2024-10-24 12:49:22,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:49:22,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:49:22,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:49:22,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:49:22,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:49:16" (1/3) ... [2024-10-24 12:49:22,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4998fb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:49:22, skipping insertion in model container [2024-10-24 12:49:22,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:19" (2/3) ... [2024-10-24 12:49:22,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4998fb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:49:22, skipping insertion in model container [2024-10-24 12:49:22,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:49:22" (3/3) ... [2024-10-24 12:49:22,303 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_reserve_harness_negated.i [2024-10-24 12:49:22,321 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:49:22,322 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:49:22,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:49:22,408 INFO L333 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, 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;@3e74a66f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:49:22,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:49:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 12:49:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 12:49:22,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:22,428 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:22,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:22,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2044203332, now seen corresponding path program 1 times [2024-10-24 12:49:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:49:22,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904604186] [2024-10-24 12:49:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:22,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:49:22,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:49:22,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:49:22,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 12:49:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:23,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 12:49:23,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:49:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:49:23,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:49:23,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:49:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904604186] [2024-10-24 12:49:23,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904604186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:23,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:49:23,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:49:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999936660] [2024-10-24 12:49:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:23,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:49:23,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:49:23,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:49:23,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:49:23,419 INFO L87 Difference]: Start difference. First operand has 142 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 12:49:25,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:25,669 INFO L93 Difference]: Finished difference Result 275 states and 401 transitions. [2024-10-24 12:49:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:49:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2024-10-24 12:49:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:25,686 INFO L225 Difference]: With dead ends: 275 [2024-10-24 12:49:25,686 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 12:49:25,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:49:25,701 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:25,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 12:49:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 12:49:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-24 12:49:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 87 states have (on average 1.264367816091954) internal successors, (110), 88 states have internal predecessors, (110), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 12:49:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 185 transitions. [2024-10-24 12:49:25,768 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 185 transitions. Word has length 46 [2024-10-24 12:49:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:25,769 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 185 transitions. [2024-10-24 12:49:25,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 12:49:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 185 transitions. [2024-10-24 12:49:25,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 12:49:25,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:25,773 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:25,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 12:49:25,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:49:25,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:25,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1132297525, now seen corresponding path program 1 times [2024-10-24 12:49:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:49:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472017873] [2024-10-24 12:49:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:25,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:49:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:49:25,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:49:25,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 12:49:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:26,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 12:49:26,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:49:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:49:26,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:49:26,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:49:26,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472017873] [2024-10-24 12:49:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472017873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:26,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:49:26,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:49:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16874708] [2024-10-24 12:49:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:26,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:49:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:49:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:49:26,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:49:26,841 INFO L87 Difference]: Start difference. First operand 138 states and 185 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 12:49:28,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:30,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:31,233 INFO L93 Difference]: Finished difference Result 265 states and 359 transitions. [2024-10-24 12:49:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:49:31,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 46 [2024-10-24 12:49:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:31,239 INFO L225 Difference]: With dead ends: 265 [2024-10-24 12:49:31,239 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 12:49:31,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:49:31,241 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 16 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:31,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 448 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 12:49:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 12:49:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-24 12:49:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 90 states have internal predecessors, (111), 38 states have call successors, (38), 12 states have call predecessors, (38), 13 states have return successors, (41), 37 states have call predecessors, (41), 37 states have call successors, (41) [2024-10-24 12:49:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2024-10-24 12:49:31,266 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 46 [2024-10-24 12:49:31,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:31,267 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2024-10-24 12:49:31,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 12:49:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2024-10-24 12:49:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 12:49:31,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:31,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:31,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 12:49:31,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:49:31,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:31,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1100834168, now seen corresponding path program 1 times [2024-10-24 12:49:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:49:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926676048] [2024-10-24 12:49:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:31,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:49:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:49:31,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:49:31,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 12:49:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:32,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 12:49:32,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:49:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:49:32,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:49:32,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:49:32,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926676048] [2024-10-24 12:49:32,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926676048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:32,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:49:32,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:49:32,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364027486] [2024-10-24 12:49:32,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:32,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:49:32,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:49:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:49:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:49:32,175 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 12:49:33,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:35,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:37,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:37,138 INFO L93 Difference]: Finished difference Result 270 states and 373 transitions. [2024-10-24 12:49:37,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:49:37,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-10-24 12:49:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:37,140 INFO L225 Difference]: With dead ends: 270 [2024-10-24 12:49:37,140 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 12:49:37,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:49:37,142 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:37,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 509 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-24 12:49:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 12:49:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2024-10-24 12:49:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 92 states have internal predecessors, (113), 38 states have call successors, (38), 12 states have call predecessors, (38), 13 states have return successors, (41), 37 states have call predecessors, (41), 37 states have call successors, (41) [2024-10-24 12:49:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 192 transitions. [2024-10-24 12:49:37,161 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 192 transitions. Word has length 52 [2024-10-24 12:49:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:37,161 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 192 transitions. [2024-10-24 12:49:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 12:49:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 192 transitions. [2024-10-24 12:49:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 12:49:37,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:37,163 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:37,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 12:49:37,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:49:37,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:37,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1802434042, now seen corresponding path program 1 times [2024-10-24 12:49:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:49:37,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510710729] [2024-10-24 12:49:37,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:37,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:49:37,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:49:37,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:49:37,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 12:49:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:38,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 1426 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 12:49:38,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:49:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:49:38,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:49:38,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:49:38,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510710729] [2024-10-24 12:49:38,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510710729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:38,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:49:38,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:49:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702932411] [2024-10-24 12:49:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:38,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:49:38,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:49:38,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:49:38,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:49:38,074 INFO L87 Difference]: Start difference. First operand 142 states and 192 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 12:49:39,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:41,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:42,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:44,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:49:44,744 INFO L93 Difference]: Finished difference Result 273 states and 376 transitions. [2024-10-24 12:49:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:49:44,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-10-24 12:49:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:49:44,746 INFO L225 Difference]: With dead ends: 273 [2024-10-24 12:49:44,746 INFO L226 Difference]: Without dead ends: 144 [2024-10-24 12:49:44,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:49:44,748 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-24 12:49:44,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-24 12:49:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-24 12:49:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-10-24 12:49:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 92 states have (on average 1.25) internal successors, (115), 94 states have internal predecessors, (115), 38 states have call successors, (38), 12 states have call predecessors, (38), 13 states have return successors, (41), 37 states have call predecessors, (41), 37 states have call successors, (41) [2024-10-24 12:49:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 194 transitions. [2024-10-24 12:49:44,762 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 194 transitions. Word has length 52 [2024-10-24 12:49:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:49:44,763 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 194 transitions. [2024-10-24 12:49:44,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 12:49:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 194 transitions. [2024-10-24 12:49:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 12:49:44,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:49:44,766 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:49:44,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 12:49:44,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:49:44,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:49:44,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:49:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1173220726, now seen corresponding path program 1 times [2024-10-24 12:49:44,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 12:49:44,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654058954] [2024-10-24 12:49:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:49:44,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 12:49:44,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 12:49:44,970 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 12:49:44,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 12:49:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:49:45,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 12:49:45,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:49:45,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 12:49:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:49:46,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:49:46,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 12:49:46,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654058954] [2024-10-24 12:49:46,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654058954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:49:46,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:49:46,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:49:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813224549] [2024-10-24 12:49:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:49:46,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:49:46,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 12:49:46,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:49:46,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:49:46,364 INFO L87 Difference]: Start difference. First operand 144 states and 194 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 12:49:48,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:49,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:49:51,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:53,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:49:54,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 12:49:56,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []