./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c061a12cbc38eba33828b4010e38aa9d2f9e1471733e9a6b829e0f771d8d2fcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:06:55,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:06:55,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:06:55,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:06:55,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:06:55,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:06:55,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:06:55,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:06:55,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:06:55,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:06:55,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:06:55,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:06:55,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:06:55,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:06:55,559 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:06:55,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:06:55,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:06:55,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:06:55,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:06:55,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:06:55,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:06:55,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:06:55,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:06:55,560 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:06:55,560 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:06:55,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:06:55,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:06:55,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:06:55,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:06:55,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:06:55,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:06:55,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:06:55,561 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:06:55,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:06:55,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:06:55,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:06:55,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:06:55,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:06:55,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:06:55,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:06:55,562 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c061a12cbc38eba33828b4010e38aa9d2f9e1471733e9a6b829e0f771d8d2fcd [2025-03-08 18:06:55,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:06:55,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:06:55,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:06:55,802 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:06:55,802 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:06:55,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2025-03-08 18:06:56,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946411d6b/f03ca358fec64abd947748c8ccb00afd/FLAG5e7b4bd1a [2025-03-08 18:06:57,440 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:06:57,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2025-03-08 18:06:57,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946411d6b/f03ca358fec64abd947748c8ccb00afd/FLAG5e7b4bd1a [2025-03-08 18:06:57,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946411d6b/f03ca358fec64abd947748c8ccb00afd [2025-03-08 18:06:57,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:06:57,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:06:57,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:06:57,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:06:57,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:06:57,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:06:57" (1/1) ... [2025-03-08 18:06:57,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2997c437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:57, skipping insertion in model container [2025-03-08 18:06:57,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:06:57" (1/1) ... [2025-03-08 18:06:57,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:06:57,834 WARN L250 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_hash_table_init_unbounded_harness.i[4503,4516] [2025-03-08 18:06:57,843 WARN L250 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_hash_table_init_unbounded_harness.i[4563,4576] [2025-03-08 18:06:58,501 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,502 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,502 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,502 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,503 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,515 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,515 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,516 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,516 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,518 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,518 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,519 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:58,519 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,188 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,189 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,223 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,224 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,231 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,232 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,249 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,250 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,250 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,250 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,251 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,251 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,251 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,317 WARN L250 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_hash_table_init_unbounded_harness.i[227916,227929] [2025-03-08 18:06:59,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:06:59,347 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:06:59,357 WARN L250 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_hash_table_init_unbounded_harness.i[4503,4516] [2025-03-08 18:06:59,358 WARN L250 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_hash_table_init_unbounded_harness.i[4563,4576] [2025-03-08 18:06:59,384 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,384 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,385 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,385 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,385 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,393 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,394 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,395 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,395 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,396 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,397 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,397 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,397 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7576-7587] [2025-03-08 18:06:59,518 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,519 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,525 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,525 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,527 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,527 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,536 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,537 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,537 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,537 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,537 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,537 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:59,551 WARN L250 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_hash_table_init_unbounded_harness.i[227916,227929] [2025-03-08 18:06:59,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:06:59,757 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:06:59,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59 WrapperNode [2025-03-08 18:06:59,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:06:59,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:06:59,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:06:59,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:06:59,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,891 INFO L138 Inliner]: procedures = 764, calls = 2425, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 831 [2025-03-08 18:06:59,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:06:59,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:06:59,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:06:59,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:06:59,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,917 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 18:06:59,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:06:59,982 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:06:59,982 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:06:59,982 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:06:59,983 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (1/1) ... [2025-03-08 18:06:59,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:06:59,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:07:00,010 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) [2025-03-08 18:07:00,012 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 [2025-03-08 18:07:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-03-08 18:07:00,034 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-03-08 18:07:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 18:07:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:07:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-08 18:07:00,034 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-08 18:07:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-03-08 18:07:00,034 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-03-08 18:07:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-03-08 18:07:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 18:07:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-08 18:07:00,036 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-08 18:07:00,286 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:07:00,288 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:07:00,328 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10008: havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~short1492;havoc #t~mem1493.base, #t~mem1493.offset;havoc #t~ret1494;havoc #t~short1495; [2025-03-08 18:07:00,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-08 18:07:00,357 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10121: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-08 18:07:00,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6940: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset; [2025-03-08 18:07:00,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-03-08 18:07:00,531 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-03-08 18:07:00,531 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9201: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-03-08 18:07:00,534 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc #t~ret600.base, #t~ret600.offset; [2025-03-08 18:07:00,536 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-08 18:07:00,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-08 18:07:00,709 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7009: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-03-08 18:07:00,709 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9172: call ULTIMATE.dealloc(~#required_bytes~3#1.base, ~#required_bytes~3#1.offset);havoc ~#required_bytes~3#1.base, ~#required_bytes~3#1.offset; [2025-03-08 18:07:00,730 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-08 18:07:00,740 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-08 18:07:06,202 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260-1: assume false; [2025-03-08 18:07:06,202 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260-1: assume !false; [2025-03-08 18:07:06,302 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-03-08 18:07:06,302 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:07:06,333 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:07:06,333 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:07:06,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:07:06 BoogieIcfgContainer [2025-03-08 18:07:06,333 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:07:06,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:07:06,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:07:06,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:07:06,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:06:57" (1/3) ... [2025-03-08 18:07:06,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7a9530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:07:06, skipping insertion in model container [2025-03-08 18:07:06,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:59" (2/3) ... [2025-03-08 18:07:06,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7a9530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:07:06, skipping insertion in model container [2025-03-08 18:07:06,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:07:06" (3/3) ... [2025-03-08 18:07:06,343 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_unbounded_harness.i [2025-03-08 18:07:06,357 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:07:06,359 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_unbounded_harness.i that has 19 procedures, 192 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 18:07:06,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:07:06,415 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;@723e0917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:07:06,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:07:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 138 states have internal predecessors, (176), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 18:07:06,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:07:06,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:06,425 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:07:06,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:06,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash 824223374, now seen corresponding path program 1 times [2025-03-08 18:07:06,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:06,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307974137] [2025-03-08 18:07:06,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:10,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:07:10,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:07:10,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:10,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 18:07:11,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:11,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307974137] [2025-03-08 18:07:11,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307974137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:07:11,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952988527] [2025-03-08 18:07:11,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:11,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:07:11,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:07:11,408 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) [2025-03-08 18:07:11,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 18:07:15,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:07:15,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:07:15,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:15,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:15,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 4093 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:07:15,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:07:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 18:07:15,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:07:15,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952988527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:15,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:07:15,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:07:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675923166] [2025-03-08 18:07:15,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:15,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:07:15,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:15,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:07:15,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:07:15,905 INFO L87 Difference]: Start difference. First operand has 192 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 138 states have internal predecessors, (176), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:07:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:16,007 INFO L93 Difference]: Finished difference Result 373 states and 497 transitions. [2025-03-08 18:07:16,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:07:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2025-03-08 18:07:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:16,014 INFO L225 Difference]: With dead ends: 373 [2025-03-08 18:07:16,014 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 18:07:16,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:07:16,018 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:16,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:07:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 18:07:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-08 18:07:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 132 states have internal predecessors, (165), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 18:07:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 234 transitions. [2025-03-08 18:07:16,056 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 234 transitions. Word has length 70 [2025-03-08 18:07:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:16,057 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 234 transitions. [2025-03-08 18:07:16,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:07:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 234 transitions. [2025-03-08 18:07:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:07:16,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:16,059 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:07:16,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 18:07:16,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 18:07:16,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:16,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 375236812, now seen corresponding path program 1 times [2025-03-08 18:07:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868269486] [2025-03-08 18:07:16,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:19,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:07:20,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:07:20,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:20,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 18:07:21,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:21,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868269486] [2025-03-08 18:07:21,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868269486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:21,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:21,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:21,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221730098] [2025-03-08 18:07:21,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:21,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:21,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:21,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:21,052 INFO L87 Difference]: Start difference. First operand 185 states and 234 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:07:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:21,398 INFO L93 Difference]: Finished difference Result 317 states and 391 transitions. [2025-03-08 18:07:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:21,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2025-03-08 18:07:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:21,401 INFO L225 Difference]: With dead ends: 317 [2025-03-08 18:07:21,401 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 18:07:21,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:21,402 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:21,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 670 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:07:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 18:07:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-08 18:07:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 133 states have (on average 1.255639097744361) internal successors, (167), 134 states have internal predecessors, (167), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 18:07:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 236 transitions. [2025-03-08 18:07:21,415 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 236 transitions. Word has length 70 [2025-03-08 18:07:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:21,415 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 236 transitions. [2025-03-08 18:07:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:07:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 236 transitions. [2025-03-08 18:07:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 18:07:21,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:21,417 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:07:21,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:07:21,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:21,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1172039373, now seen corresponding path program 1 times [2025-03-08 18:07:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:21,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745156191] [2025-03-08 18:07:21,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:25,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 18:07:25,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 18:07:25,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:25,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 18:07:25,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745156191] [2025-03-08 18:07:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745156191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:25,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:25,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108657375] [2025-03-08 18:07:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:25,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:25,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:25,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:25,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:25,919 INFO L87 Difference]: Start difference. First operand 187 states and 236 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:07:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:26,238 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2025-03-08 18:07:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:26,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2025-03-08 18:07:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:26,241 INFO L225 Difference]: With dead ends: 225 [2025-03-08 18:07:26,241 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 18:07:26,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:26,242 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:26,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 670 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:07:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 18:07:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-08 18:07:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 136 states have (on average 1.25) internal successors, (170), 137 states have internal predecessors, (170), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) [2025-03-08 18:07:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 240 transitions. [2025-03-08 18:07:26,251 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 240 transitions. Word has length 72 [2025-03-08 18:07:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:26,251 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 240 transitions. [2025-03-08 18:07:26,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:07:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 240 transitions. [2025-03-08 18:07:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 18:07:26,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:26,253 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:07:26,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:07:26,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:26,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:26,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1997060270, now seen corresponding path program 1 times [2025-03-08 18:07:26,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:26,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853770192] [2025-03-08 18:07:26,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:26,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:29,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 18:07:29,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 18:07:29,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:29,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 18:07:30,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:30,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853770192] [2025-03-08 18:07:30,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853770192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:30,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:30,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139866631] [2025-03-08 18:07:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:30,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:30,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:30,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:30,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:30,430 INFO L87 Difference]: Start difference. First operand 191 states and 240 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:30,728 INFO L93 Difference]: Finished difference Result 225 states and 278 transitions. [2025-03-08 18:07:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:30,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2025-03-08 18:07:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:30,731 INFO L225 Difference]: With dead ends: 225 [2025-03-08 18:07:30,731 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 18:07:30,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:30,732 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:30,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:07:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 18:07:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2025-03-08 18:07:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 133 states have (on average 1.2406015037593985) internal successors, (165), 134 states have internal predecessors, (165), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 18:07:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 234 transitions. [2025-03-08 18:07:30,741 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 234 transitions. Word has length 77 [2025-03-08 18:07:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:30,741 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 234 transitions. [2025-03-08 18:07:30,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 234 transitions. [2025-03-08 18:07:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 18:07:30,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:30,742 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:07:30,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:07:30,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:30,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1964912643, now seen corresponding path program 1 times [2025-03-08 18:07:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650298397] [2025-03-08 18:07:30,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:34,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 18:07:34,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 18:07:34,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:34,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 18:07:35,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:35,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650298397] [2025-03-08 18:07:35,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650298397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:35,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:35,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:07:35,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716477472] [2025-03-08 18:07:35,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:35,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:07:35,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:35,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:07:35,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:07:35,455 INFO L87 Difference]: Start difference. First operand 187 states and 234 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 18:07:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:35,941 INFO L93 Difference]: Finished difference Result 297 states and 364 transitions. [2025-03-08 18:07:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:07:35,942 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2025-03-08 18:07:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:35,944 INFO L225 Difference]: With dead ends: 297 [2025-03-08 18:07:35,944 INFO L226 Difference]: Without dead ends: 192 [2025-03-08 18:07:35,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:07:35,945 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:35,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 884 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:07:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-08 18:07:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-03-08 18:07:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 137 states have (on average 1.2335766423357664) internal successors, (169), 138 states have internal predecessors, (169), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (37), 35 states have call predecessors, (37), 34 states have call successors, (37) [2025-03-08 18:07:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 241 transitions. [2025-03-08 18:07:35,960 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 241 transitions. Word has length 94 [2025-03-08 18:07:35,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:35,960 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 241 transitions. [2025-03-08 18:07:35,961 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 18:07:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 241 transitions. [2025-03-08 18:07:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 18:07:35,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:35,963 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:07:35,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 18:07:35,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:35,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2105341794, now seen corresponding path program 1 times [2025-03-08 18:07:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:35,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552123234] [2025-03-08 18:07:35,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:35,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:39,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 18:07:39,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 18:07:39,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:39,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 18:07:42,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:42,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552123234] [2025-03-08 18:07:42,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552123234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:42,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:42,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:07:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274924699] [2025-03-08 18:07:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:42,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:07:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:42,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:07:42,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:07:42,831 INFO L87 Difference]: Start difference. First operand 192 states and 241 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:07:46,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:07:51,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:07:55,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:08:00,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:08:04,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:08:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:09,094 INFO L93 Difference]: Finished difference Result 236 states and 293 transitions. [2025-03-08 18:08:09,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:08:09,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-03-08 18:08:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:09,099 INFO L225 Difference]: With dead ends: 236 [2025-03-08 18:08:09,099 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 18:08:09,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:08:09,100 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 11 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:09,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1429 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 5 Unknown, 0 Unchecked, 25.6s Time] [2025-03-08 18:08:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 18:08:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2025-03-08 18:08:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 143 states have internal predecessors, (174), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (38), 35 states have call predecessors, (38), 34 states have call successors, (38) [2025-03-08 18:08:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 247 transitions. [2025-03-08 18:08:09,112 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 247 transitions. Word has length 100 [2025-03-08 18:08:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:09,112 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 247 transitions. [2025-03-08 18:08:09,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:08:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 247 transitions. [2025-03-08 18:08:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 18:08:09,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:09,114 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:09,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 18:08:09,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:09,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:09,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1993111997, now seen corresponding path program 1 times [2025-03-08 18:08:09,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:09,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055768317] [2025-03-08 18:08:09,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:09,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:12,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 18:08:12,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 18:08:12,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:12,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 18:08:13,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055768317] [2025-03-08 18:08:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055768317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:13,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:08:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253938170] [2025-03-08 18:08:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:13,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:08:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:13,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:08:13,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:08:13,798 INFO L87 Difference]: Start difference. First operand 197 states and 247 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:08:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:14,323 INFO L93 Difference]: Finished difference Result 243 states and 301 transitions. [2025-03-08 18:08:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:08:14,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-03-08 18:08:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:14,325 INFO L225 Difference]: With dead ends: 243 [2025-03-08 18:08:14,325 INFO L226 Difference]: Without dead ends: 202 [2025-03-08 18:08:14,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:08:14,326 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 5 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:14,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 663 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:08:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-08 18:08:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2025-03-08 18:08:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 142 states have (on average 1.232394366197183) internal successors, (175), 144 states have internal predecessors, (175), 36 states have call successors, (36), 18 states have call predecessors, (36), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-08 18:08:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2025-03-08 18:08:14,336 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 100 [2025-03-08 18:08:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:14,336 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2025-03-08 18:08:14,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:08:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2025-03-08 18:08:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 18:08:14,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:14,338 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:14,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 18:08:14,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:14,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1713050532, now seen corresponding path program 1 times [2025-03-08 18:08:14,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:14,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762946614] [2025-03-08 18:08:14,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:14,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:17,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 18:08:17,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 18:08:17,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:17,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 18:08:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:22,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762946614] [2025-03-08 18:08:22,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762946614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:22,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 18:08:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797793767] [2025-03-08 18:08:22,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:22,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:08:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:22,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:08:22,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:08:22,727 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 18:08:26,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []