./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.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_bounded_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ace14697ac0820cd1cdf4cf69cd00f22476365c493527983be1f9a153e0d5b6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:06:51,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:06:51,202 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:51,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:06:51,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:06:51,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:06:51,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:06:51,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:06:51,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:06:51,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:06:51,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:06:51,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:06:51,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:06:51,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:06:51,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:06:51,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:06:51,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:06:51,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:06:51,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:06:51,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:06:51,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:06:51,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:06:51,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:06:51,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:06:51,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:06:51,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:06:51,242 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 -> ace14697ac0820cd1cdf4cf69cd00f22476365c493527983be1f9a153e0d5b6f [2025-03-08 18:06:51,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:06:51,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:06:51,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:06:51,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:06:51,531 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:06:51,540 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_bounded_harness_negated.i [2025-03-08 18:06:52,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16420c16/5a28467b12a8470999ddce3a3c144c70/FLAGff17ceaec [2025-03-08 18:06:53,241 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:06:53,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness_negated.i [2025-03-08 18:06:53,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16420c16/5a28467b12a8470999ddce3a3c144c70/FLAGff17ceaec [2025-03-08 18:06:53,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16420c16/5a28467b12a8470999ddce3a3c144c70 [2025-03-08 18:06:53,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:06:53,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:06:53,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:06:53,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:06:53,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:06:53,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8f7f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53, skipping insertion in model container [2025-03-08 18:06:53,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:06:53,804 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_bounded_harness_negated.i[4501,4514] [2025-03-08 18:06:53,816 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_bounded_harness_negated.i[4561,4574] [2025-03-08 18:06:54,465 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,466 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,467 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,467 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,468 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,482 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,483 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,484 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,485 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,486 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,487 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,487 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:54,487 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,241 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,243 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,267 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,268 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,274 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,277 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,301 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,302 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,303 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,304 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,304 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,305 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,305 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,350 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_bounded_harness_negated.i[228071,228084] [2025-03-08 18:06:55,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:06:55,388 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:06:55,404 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_bounded_harness_negated.i[4501,4514] [2025-03-08 18:06:55,404 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_bounded_harness_negated.i[4561,4574] [2025-03-08 18:06:55,449 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,454 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,454 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,454 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,454 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,462 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,462 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,463 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,463 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,463 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,464 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,464 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,464 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7526-7537] [2025-03-08 18:06:55,673 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,674 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,679 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,679 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,681 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,681 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,687 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,687 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,688 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,688 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,688 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,688 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,689 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:55,702 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_bounded_harness_negated.i[228071,228084] [2025-03-08 18:06:55,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:06:55,859 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:06:55,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:55 WrapperNode [2025-03-08 18:06:55,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:06:55,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:06:55,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:06:55,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:06:55,866 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:55" (1/1) ... [2025-03-08 18:06:55,937 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:55" (1/1) ... [2025-03-08 18:06:56,018 INFO L138 Inliner]: procedures = 763, calls = 2426, calls flagged for inlining = 67, calls inlined = 13, statements flattened = 854 [2025-03-08 18:06:56,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:06:56,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:06:56,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:06:56,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:06:56,026 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:55" (1/1) ... [2025-03-08 18:06:56,026 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:55" (1/1) ... [2025-03-08 18:06:56,034 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:55" (1/1) ... [2025-03-08 18:06:56,040 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 18:06:56,040 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:55" (1/1) ... [2025-03-08 18:06:56,041 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:55" (1/1) ... [2025-03-08 18:06:56,060 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:55" (1/1) ... [2025-03-08 18:06:56,062 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:55" (1/1) ... [2025-03-08 18:06:56,075 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:55" (1/1) ... [2025-03-08 18:06:56,078 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:55" (1/1) ... [2025-03-08 18:06:56,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:06:56,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:06:56,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:06:56,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:06:56,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:55" (1/1) ... [2025-03-08 18:06:56,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:06:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:06:56,119 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:06:56,131 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:06:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-03-08 18:06:56,154 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-03-08 18:06:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 18:06:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:06:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-08 18:06:56,155 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-08 18:06:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-03-08 18:06:56,156 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-03-08 18:06:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 18:06:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-03-08 18:06:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-03-08 18:06:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 18:06:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-08 18:06:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-08 18:06:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:06:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:06:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 18:06:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-08 18:06:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-08 18:06:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:06:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-08 18:06:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-08 18:06:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:06:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-08 18:06:56,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-08 18:06:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-08 18:06:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-08 18:06:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-08 18:06:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:06:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-03-08 18:06:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 18:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-08 18:06:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-08 18:06:56,438 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:06:56,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:06:56,478 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9956: havoc #t~mem1489.base, #t~mem1489.offset;havoc #t~short1490;havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~ret1492;havoc #t~short1493; [2025-03-08 18:06:56,484 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-08 18:06:56,503 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10069: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-08 18:06:56,536 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6943: 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:06:56,537 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6928: 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:06:56,655 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-03-08 18:06:56,656 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9151: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-03-08 18:06:56,660 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6974: havoc #t~ret600.base, #t~ret600.offset; [2025-03-08 18:06:56,661 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-08 18:06:56,671 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-08 18:06:56,673 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:06:56,829 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: 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:06:56,830 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9122: 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:06:56,860 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-08 18:06:56,873 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-08 18:07:02,298 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9210-1: assume false; [2025-03-08 18:07:02,298 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9210-1: assume !false; [2025-03-08 18:07:02,450 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2025-03-08 18:07:02,451 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:07:02,481 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:07:02,481 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:07:02,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:07:02 BoogieIcfgContainer [2025-03-08 18:07:02,482 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:07:02,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:07:02,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:07:02,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:07:02,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:06:53" (1/3) ... [2025-03-08 18:07:02,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591cf463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:07:02, skipping insertion in model container [2025-03-08 18:07:02,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:55" (2/3) ... [2025-03-08 18:07:02,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591cf463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:07:02, skipping insertion in model container [2025-03-08 18:07:02,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:07:02" (3/3) ... [2025-03-08 18:07:02,495 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_bounded_harness_negated.i [2025-03-08 18:07:02,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:07:02,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_bounded_harness_negated.i that has 20 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 18:07:02,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:07:02,568 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;@6ddcd509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:07:02,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:07:02,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 147 states have (on average 1.2653061224489797) internal successors, (186), 147 states have internal predecessors, (186), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 18:07:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:07:02,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:02,582 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:02,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash 221123891, now seen corresponding path program 1 times [2025-03-08 18:07:02,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:02,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769439098] [2025-03-08 18:07:02,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:02,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:07,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:07:07,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:07:07,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:07,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 18:07:07,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769439098] [2025-03-08 18:07:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769439098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:07:07,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48342632] [2025-03-08 18:07:07,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:07,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:07:07,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:07:07,921 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:07,924 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:12,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:07:12,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:07:12,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:12,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:12,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 4103 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:07:12,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:07:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 18:07:12,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:07:12,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48342632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:12,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:07:12,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:07:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469038443] [2025-03-08 18:07:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:12,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:07:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:12,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:07:12,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:07:12,614 INFO L87 Difference]: Start difference. First operand has 206 states, 147 states have (on average 1.2653061224489797) internal successors, (186), 147 states have internal predecessors, (186), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:12,717 INFO L93 Difference]: Finished difference Result 401 states and 536 transitions. [2025-03-08 18:07:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:07:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-03-08 18:07:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:12,724 INFO L225 Difference]: With dead ends: 401 [2025-03-08 18:07:12,725 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 18:07:12,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:12,729 INFO L435 NwaCegarLoop]: 252 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, 252 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:12,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 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:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 18:07:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-08 18:07:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 139 states have internal predecessors, (172), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 18:07:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 249 transitions. [2025-03-08 18:07:12,767 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 249 transitions. Word has length 76 [2025-03-08 18:07:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:12,768 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 249 transitions. [2025-03-08 18:07:12,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 249 transitions. [2025-03-08 18:07:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:07:12,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:12,770 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,785 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:12,971 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:12,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:12,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:12,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2035710192, now seen corresponding path program 1 times [2025-03-08 18:07:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:12,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174253069] [2025-03-08 18:07:12,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:12,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:16,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:07:16,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:07:16,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:16,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:07:17,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:17,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174253069] [2025-03-08 18:07:17,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174253069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:17,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:17,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:17,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38143681] [2025-03-08 18:07:17,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:17,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:17,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:17,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:17,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:17,695 INFO L87 Difference]: Start difference. First operand 197 states and 249 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:18,051 INFO L93 Difference]: Finished difference Result 339 states and 418 transitions. [2025-03-08 18:07:18,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:18,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-03-08 18:07:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:18,055 INFO L225 Difference]: With dead ends: 339 [2025-03-08 18:07:18,055 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 18:07:18,056 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:18,057 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 715 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:18,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 715 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:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 18:07:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-08 18:07:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.2428571428571429) internal successors, (174), 141 states have internal predecessors, (174), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 18:07:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 251 transitions. [2025-03-08 18:07:18,070 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 251 transitions. Word has length 76 [2025-03-08 18:07:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:18,070 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 251 transitions. [2025-03-08 18:07:18,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 251 transitions. [2025-03-08 18:07:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 18:07:18,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:18,072 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:07:18,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:18,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:18,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1300237359, now seen corresponding path program 1 times [2025-03-08 18:07:18,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:18,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064506636] [2025-03-08 18:07:18,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:18,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:22,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 18:07:22,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 18:07:22,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:22,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:07:23,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:23,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064506636] [2025-03-08 18:07:23,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064506636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:23,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:23,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790486289] [2025-03-08 18:07:23,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:23,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:23,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:23,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:23,078 INFO L87 Difference]: Start difference. First operand 199 states and 251 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:23,538 INFO L93 Difference]: Finished difference Result 251 states and 309 transitions. [2025-03-08 18:07:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:23,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2025-03-08 18:07:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:23,543 INFO L225 Difference]: With dead ends: 251 [2025-03-08 18:07:23,543 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 18:07:23,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:23,544 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 715 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:23,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 715 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:07:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 18:07:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-08 18:07:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 144 states have internal predecessors, (177), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-08 18:07:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 255 transitions. [2025-03-08 18:07:23,562 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 255 transitions. Word has length 78 [2025-03-08 18:07:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:23,563 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 255 transitions. [2025-03-08 18:07:23,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 255 transitions. [2025-03-08 18:07:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 18:07:23,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:23,567 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:07:23,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:23,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:23,568 INFO L85 PathProgramCache]: Analyzing trace with hash -676388783, now seen corresponding path program 1 times [2025-03-08 18:07:23,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:23,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285186530] [2025-03-08 18:07:23,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:27,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 18:07:27,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 18:07:27,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:27,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:07:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285186530] [2025-03-08 18:07:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285186530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:28,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:28,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243764670] [2025-03-08 18:07:28,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:28,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:28,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:28,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:28,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:28,107 INFO L87 Difference]: Start difference. First operand 203 states and 255 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:07:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:28,419 INFO L93 Difference]: Finished difference Result 251 states and 308 transitions. [2025-03-08 18:07:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:28,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-03-08 18:07:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:28,422 INFO L225 Difference]: With dead ends: 251 [2025-03-08 18:07:28,422 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 18:07:28,423 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:28,423 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 0 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 717 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:28,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 717 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:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 18:07:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2025-03-08 18:07:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 141 states have internal predecessors, (172), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 18:07:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 249 transitions. [2025-03-08 18:07:28,442 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 249 transitions. Word has length 83 [2025-03-08 18:07:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:28,442 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 249 transitions. [2025-03-08 18:07:28,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:07:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 249 transitions. [2025-03-08 18:07:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 18:07:28,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:28,445 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:07:28,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:28,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash -627455967, now seen corresponding path program 1 times [2025-03-08 18:07:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:28,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585904991] [2025-03-08 18:07:28,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:31,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 18:07:32,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 18:07:32,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:32,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:07:32,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:32,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585904991] [2025-03-08 18:07:32,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585904991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:32,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:32,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:07:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988361666] [2025-03-08 18:07:32,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:32,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:07:32,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:32,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:07:32,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:07:32,836 INFO L87 Difference]: Start difference. First operand 199 states and 249 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:07:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:33,285 INFO L93 Difference]: Finished difference Result 319 states and 391 transitions. [2025-03-08 18:07:33,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:07:33,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 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:07:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:33,289 INFO L225 Difference]: With dead ends: 319 [2025-03-08 18:07:33,289 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 18:07:33,289 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:33,291 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 944 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:33,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 944 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:07:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 18:07:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 18:07:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 144 states have (on average 1.2222222222222223) internal successors, (176), 145 states have internal predecessors, (176), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-03-08 18:07:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 256 transitions. [2025-03-08 18:07:33,310 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 256 transitions. Word has length 100 [2025-03-08 18:07:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:33,310 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 256 transitions. [2025-03-08 18:07:33,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:07:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 256 transitions. [2025-03-08 18:07:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 18:07:33,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:33,311 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 18:07:33,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:33,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:33,312 INFO L85 PathProgramCache]: Analyzing trace with hash 519981789, now seen corresponding path program 1 times [2025-03-08 18:07:33,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:33,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432631428] [2025-03-08 18:07:33,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:33,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:36,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 18:07:37,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 18:07:37,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:37,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:07:39,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:39,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432631428] [2025-03-08 18:07:39,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432631428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:39,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:39,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:07:39,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561284318] [2025-03-08 18:07:39,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:39,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:07:39,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:39,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:07:39,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:07:39,342 INFO L87 Difference]: Start difference. First operand 204 states and 256 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 18:07:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:39,925 INFO L93 Difference]: Finished difference Result 259 states and 318 transitions. [2025-03-08 18:07:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:07:39,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-03-08 18:07:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:39,927 INFO L225 Difference]: With dead ends: 259 [2025-03-08 18:07:39,927 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 18:07:39,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:07:39,930 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:39,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 948 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 18:07:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 18:07:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 18:07:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 144 states have (on average 1.2083333333333333) internal successors, (174), 145 states have internal predecessors, (174), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-03-08 18:07:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2025-03-08 18:07:39,941 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 106 [2025-03-08 18:07:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:39,942 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2025-03-08 18:07:39,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 18:07:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2025-03-08 18:07:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 18:07:39,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:39,945 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 18:07:39,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:39,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1386104424, now seen corresponding path program 1 times [2025-03-08 18:07:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932365408] [2025-03-08 18:07:39,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:39,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:43,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 18:07:43,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 18:07:43,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:43,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 18:07:44,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:44,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932365408] [2025-03-08 18:07:44,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932365408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:44,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:44,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:44,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621672809] [2025-03-08 18:07:44,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:44,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:44,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:44,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:44,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:44,414 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 18:07:44,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:44,726 INFO L93 Difference]: Finished difference Result 322 states and 390 transitions. [2025-03-08 18:07:44,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:44,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 141 [2025-03-08 18:07:44,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:44,729 INFO L225 Difference]: With dead ends: 322 [2025-03-08 18:07:44,729 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 18:07:44,729 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:44,730 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:44,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 707 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:07:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 18:07:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2025-03-08 18:07:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.2) internal successors, (168), 141 states have internal predecessors, (168), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 18:07:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 245 transitions. [2025-03-08 18:07:44,739 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 245 transitions. Word has length 141 [2025-03-08 18:07:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:44,739 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 245 transitions. [2025-03-08 18:07:44,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 18:07:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 245 transitions. [2025-03-08 18:07:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 18:07:44,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:44,741 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 18:07:44,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:44,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash -371590405, now seen corresponding path program 1 times [2025-03-08 18:07:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:44,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861520839] [2025-03-08 18:07:44,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:48,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 18:07:48,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 18:07:48,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:48,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-08 18:07:49,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:49,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861520839] [2025-03-08 18:07:49,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861520839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:49,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:49,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:07:49,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267278532] [2025-03-08 18:07:49,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:49,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:07:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:49,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:07:49,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:07:49,379 INFO L87 Difference]: Start difference. First operand 199 states and 245 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 18:07:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:50,045 INFO L93 Difference]: Finished difference Result 261 states and 317 transitions. [2025-03-08 18:07:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:07:50,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2025-03-08 18:07:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:50,047 INFO L225 Difference]: With dead ends: 261 [2025-03-08 18:07:50,047 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 18:07:50,048 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:50,048 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:50,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 926 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 18:07:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 18:07:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 18:07:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 144 states have (on average 1.1944444444444444) internal successors, (172), 145 states have internal predecessors, (172), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-03-08 18:07:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 252 transitions. [2025-03-08 18:07:50,061 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 252 transitions. Word has length 147 [2025-03-08 18:07:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:50,061 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 252 transitions. [2025-03-08 18:07:50,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 18:07:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 252 transitions. [2025-03-08 18:07:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 18:07:50,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:50,063 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 18:07:50,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:50,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:50,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1437030025, now seen corresponding path program 1 times [2025-03-08 18:07:50,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:50,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109315741] [2025-03-08 18:07:50,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:53,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 18:07:53,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 18:07:53,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:53,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 18:07:54,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:54,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109315741] [2025-03-08 18:07:54,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109315741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:54,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:54,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:54,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701412543] [2025-03-08 18:07:54,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:54,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:54,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:54,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:54,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:54,840 INFO L87 Difference]: Start difference. First operand 204 states and 252 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 18:07:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:55,359 INFO L93 Difference]: Finished difference Result 261 states and 316 transitions. [2025-03-08 18:07:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:55,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2025-03-08 18:07:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:55,361 INFO L225 Difference]: With dead ends: 261 [2025-03-08 18:07:55,361 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 18:07:55,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:55,362 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:55,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 702 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:07:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 18:07:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2025-03-08 18:07:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.1928571428571428) internal successors, (167), 141 states have internal predecessors, (167), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 18:07:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 244 transitions. [2025-03-08 18:07:55,370 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 244 transitions. Word has length 153 [2025-03-08 18:07:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:55,371 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 244 transitions. [2025-03-08 18:07:55,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 18:07:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 244 transitions. [2025-03-08 18:07:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 18:07:55,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:55,372 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 18:07:55,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:55,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:55,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1861418207, now seen corresponding path program 1 times [2025-03-08 18:07:55,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192662222] [2025-03-08 18:07:55,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:59,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 18:07:59,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 18:07:59,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:59,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 18:08:00,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:00,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192662222] [2025-03-08 18:08:00,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192662222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:00,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:00,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 18:08:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800045520] [2025-03-08 18:08:00,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:00,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:08:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:00,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:08:00,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:08:00,643 INFO L87 Difference]: Start difference. First operand 199 states and 244 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 18:08:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:01,402 INFO L93 Difference]: Finished difference Result 263 states and 316 transitions. [2025-03-08 18:08:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:08:01,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-03-08 18:08:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:01,404 INFO L225 Difference]: With dead ends: 263 [2025-03-08 18:08:01,404 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 18:08:01,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:08:01,405 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:01,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1146 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 18:08:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 18:08:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2025-03-08 18:08:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 144 states have (on average 1.1875) internal successors, (171), 145 states have internal predecessors, (171), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-08 18:08:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 249 transitions. [2025-03-08 18:08:01,413 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 249 transitions. Word has length 160 [2025-03-08 18:08:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:01,413 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 249 transitions. [2025-03-08 18:08:01,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 18:08:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 249 transitions. [2025-03-08 18:08:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 18:08:01,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:01,416 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 18:08:01,416 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:01,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2014153048, now seen corresponding path program 1 times [2025-03-08 18:08:01,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:01,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390949989] [2025-03-08 18:08:01,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:05,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 18:08:05,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 18:08:05,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:05,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 18:08:07,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:07,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390949989] [2025-03-08 18:08:07,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390949989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:07,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:07,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:08:07,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709255509] [2025-03-08 18:08:07,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:07,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:08:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:07,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:08:07,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:08:07,150 INFO L87 Difference]: Start difference. First operand 204 states and 249 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-08 18:08:08,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:08,298 INFO L93 Difference]: Finished difference Result 262 states and 314 transitions. [2025-03-08 18:08:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:08:08,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 166 [2025-03-08 18:08:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:08,301 INFO L225 Difference]: With dead ends: 262 [2025-03-08 18:08:08,301 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 18:08:08,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:08:08,302 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:08,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1601 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 18:08:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 18:08:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-08 18:08:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 140 states have internal predecessors, (164), 38 states have call successors, (38), 19 states have call predecessors, (38), 19 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 18:08:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 239 transitions. [2025-03-08 18:08:08,310 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 239 transitions. Word has length 166 [2025-03-08 18:08:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:08,311 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 239 transitions. [2025-03-08 18:08:08,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-08 18:08:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 239 transitions. [2025-03-08 18:08:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 18:08:08,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:08,313 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 18:08:08,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:08,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash 51684915, now seen corresponding path program 1 times [2025-03-08 18:08:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:08,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751142402] [2025-03-08 18:08:08,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:11,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 18:08:11,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 18:08:11,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:11,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-08 18:08:17,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:17,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751142402] [2025-03-08 18:08:17,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751142402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:17,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:17,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 18:08:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81760353] [2025-03-08 18:08:17,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:17,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 18:08:17,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:17,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 18:08:17,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 18:08:17,305 INFO L87 Difference]: Start difference. First operand 197 states and 239 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27)