./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 07:14:18,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 07:14:18,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 07:14:18,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 07:14:18,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 07:14:18,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 07:14:18,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 07:14:18,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 07:14:18,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 07:14:18,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 07:14:18,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 07:14:18,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 07:14:18,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 07:14:18,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 07:14:18,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 07:14:18,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 07:14:18,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 07:14:18,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 07:14:18,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 07:14:18,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 07:14:18,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 07:14:18,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 07:14:18,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 07:14:18,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 07:14:18,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 07:14:18,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 07:14:18,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 07:14:18,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 07:14:18,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 07:14:18,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:14:18,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 07:14:18,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 07:14:18,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 07:14:18,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 07:14:18,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 07:14:18,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 07:14:18,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 07:14:18,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 07:14:18,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 07:14:18,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 07:14:18,342 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-17 07:14:18,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 07:14:18,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 07:14:18,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 07:14:18,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 07:14:18,575 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 07:14:18,577 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-17 07:14:19,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01c58182/595d2dadaaa7443bbe84f33475974f43/FLAG0dd821e66 [2025-03-17 07:14:20,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 07:14:20,252 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-17 07:14:20,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01c58182/595d2dadaaa7443bbe84f33475974f43/FLAG0dd821e66 [2025-03-17 07:14:20,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01c58182/595d2dadaaa7443bbe84f33475974f43 [2025-03-17 07:14:20,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 07:14:20,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 07:14:20,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 07:14:20,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 07:14:20,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 07:14:20,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:14:20" (1/1) ... [2025-03-17 07:14:20,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139ec2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:20, skipping insertion in model container [2025-03-17 07:14:20,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:14:20" (1/1) ... [2025-03-17 07:14:20,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 07:14:21,086 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-17 07:14:21,094 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-17 07:14:21,618 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,620 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,620 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,621 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,621 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,629 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,630 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,631 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,631 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,632 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,633 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,633 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:21,634 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,281 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,282 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,313 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,314 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,322 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,324 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,341 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,343 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,343 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,343 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,344 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,344 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,344 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,387 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-17 07:14:22,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:14:22,418 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 07:14:22,433 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-17 07:14:22,433 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-17 07:14:22,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,470 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,470 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,477 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,478 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,478 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,479 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,479 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,481 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,482 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,482 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7526-7537] [2025-03-17 07:14:22,654 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,655 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,660 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,661 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,662 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,662 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,667 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,667 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,668 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,668 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,668 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,668 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,668 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:14:22,679 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-17 07:14:22,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:14:22,814 INFO L204 MainTranslator]: Completed translation [2025-03-17 07:14:22,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22 WrapperNode [2025-03-17 07:14:22,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 07:14:22,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 07:14:22,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 07:14:22,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 07:14:22,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:22,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:22,945 INFO L138 Inliner]: procedures = 763, calls = 2426, calls flagged for inlining = 67, calls inlined = 13, statements flattened = 854 [2025-03-17 07:14:22,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 07:14:22,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 07:14:22,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 07:14:22,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 07:14:22,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:22,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:22,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:22,969 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 07:14:22,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:22,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:22,993 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:22,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:23,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:23,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:23,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 07:14:23,012 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 07:14:23,012 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 07:14:23,013 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 07:14:23,013 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (1/1) ... [2025-03-17 07:14:23,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:14:23,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:14:23,046 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-17 07:14:23,049 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-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-03-17 07:14:23,069 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-17 07:14:23,069 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-03-17 07:14:23,069 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-03-17 07:14:23,069 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-17 07:14:23,069 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 07:14:23,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 07:14:23,069 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-17 07:14:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-17 07:14:23,070 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-17 07:14:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 07:14:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-03-17 07:14:23,073 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-03-17 07:14:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 07:14:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-17 07:14:23,073 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-17 07:14:23,330 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 07:14:23,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 07:14:23,390 INFO L1322 $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-17 07:14:23,401 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-17 07:14:23,429 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10069: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-17 07:14:23,477 INFO L1322 $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-17 07:14:23,478 INFO L1322 $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-17 07:14:23,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-03-17 07:14:23,614 INFO L1322 $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-17 07:14:23,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6974: havoc #t~ret600.base, #t~ret600.offset; [2025-03-17 07:14:23,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-17 07:14:23,640 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-17 07:14:23,642 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-17 07:14:23,772 INFO L1322 $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-17 07:14:23,772 INFO L1322 $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-17 07:14:23,792 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-17 07:14:23,803 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-17 07:14:29,226 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9210-1: assume false; [2025-03-17 07:14:29,226 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9210-1: assume !false; [2025-03-17 07:14:29,310 INFO L? ?]: Removed 187 outVars from TransFormulas that were not future-live. [2025-03-17 07:14:29,311 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 07:14:29,335 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 07:14:29,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 07:14:29,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:14:29 BoogieIcfgContainer [2025-03-17 07:14:29,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 07:14:29,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 07:14:29,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 07:14:29,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 07:14:29,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:14:20" (1/3) ... [2025-03-17 07:14:29,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b654f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:14:29, skipping insertion in model container [2025-03-17 07:14:29,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:22" (2/3) ... [2025-03-17 07:14:29,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b654f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:14:29, skipping insertion in model container [2025-03-17 07:14:29,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:14:29" (3/3) ... [2025-03-17 07:14:29,347 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_bounded_harness_negated.i [2025-03-17 07:14:29,359 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 07:14:29,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_bounded_harness_negated.i that has 20 procedures, 200 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 07:14:29,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 07:14:29,416 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;@2062169a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 07:14:29,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 07:14:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 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-17 07:14:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 07:14:29,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:14:29,427 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] [2025-03-17 07:14:29,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:14:29,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:14:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash -578673304, now seen corresponding path program 1 times [2025-03-17 07:14:29,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:14:29,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246313502] [2025-03-17 07:14:29,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:29,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:14:33,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 07:14:34,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 07:14:34,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:14:34,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:14:34,487 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-17 07:14:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:14:34,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246313502] [2025-03-17 07:14:34,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246313502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:14:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698859474] [2025-03-17 07:14:34,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:34,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:14:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:14:34,490 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-17 07:14:34,492 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-17 07:14:38,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 07:14:39,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 07:14:39,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:14:39,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:14:39,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 4102 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 07:14:39,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:14:39,037 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-17 07:14:39,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:14:39,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698859474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:14:39,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:14:39,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 07:14:39,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108161907] [2025-03-17 07:14:39,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:14:39,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 07:14:39,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:14:39,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 07:14:39,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:14:39,059 INFO L87 Difference]: Start difference. First operand has 200 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 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.0) internal successors, (36), 2 states have internal predecessors, (36), 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-17 07:14:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:14:39,182 INFO L93 Difference]: Finished difference Result 390 states and 525 transitions. [2025-03-17 07:14:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 07:14:39,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (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 75 [2025-03-17 07:14:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:14:39,192 INFO L225 Difference]: With dead ends: 390 [2025-03-17 07:14:39,192 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 07:14:39,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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-17 07:14:39,197 INFO L435 NwaCegarLoop]: 246 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, 246 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-17 07:14:39,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:14:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 07:14:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-17 07:14:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 136 states have internal predecessors, (169), 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-17 07:14:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2025-03-17 07:14:39,230 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 75 [2025-03-17 07:14:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:14:39,231 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2025-03-17 07:14:39,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (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-17 07:14:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2025-03-17 07:14:39,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 07:14:39,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:14:39,234 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] [2025-03-17 07:14:39,249 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-17 07:14:39,434 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-17 07:14:39,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:14:39,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:14:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1459459909, now seen corresponding path program 1 times [2025-03-17 07:14:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:14:39,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255233914] [2025-03-17 07:14:39,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:14:43,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 07:14:43,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 07:14:43,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:14:43,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:14:44,402 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-17 07:14:44,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:14:44,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255233914] [2025-03-17 07:14:44,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255233914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:14:44,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:14:44,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:14:44,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171367422] [2025-03-17 07:14:44,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:14:44,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:14:44,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:14:44,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:14:44,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:14:44,405 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (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-17 07:14:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:14:44,736 INFO L93 Difference]: Finished difference Result 334 states and 413 transitions. [2025-03-17 07:14:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:14:44,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (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 75 [2025-03-17 07:14:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:14:44,739 INFO L225 Difference]: With dead ends: 334 [2025-03-17 07:14:44,739 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 07:14:44,739 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-17 07:14:44,740 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 706 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-17 07:14:44,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 706 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:14:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 07:14:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-17 07:14:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 137 states have (on average 1.2481751824817517) internal successors, (171), 138 states have internal predecessors, (171), 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-17 07:14:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2025-03-17 07:14:44,753 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 75 [2025-03-17 07:14:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:14:44,754 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2025-03-17 07:14:44,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (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-17 07:14:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2025-03-17 07:14:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 07:14:44,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:14:44,756 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] [2025-03-17 07:14:44,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 07:14:44,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:14:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:14:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1861345403, now seen corresponding path program 1 times [2025-03-17 07:14:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:14:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389046038] [2025-03-17 07:14:44,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:14:48,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 07:14:48,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 07:14:48,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:14:48,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:14:49,381 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-17 07:14:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:14:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389046038] [2025-03-17 07:14:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389046038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:14:49,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:14:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:14:49,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246380717] [2025-03-17 07:14:49,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:14:49,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:14:49,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:14:49,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:14:49,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:14:49,382 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (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-17 07:14:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:14:49,725 INFO L93 Difference]: Finished difference Result 248 states and 306 transitions. [2025-03-17 07:14:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:14:49,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (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 77 [2025-03-17 07:14:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:14:49,727 INFO L225 Difference]: With dead ends: 248 [2025-03-17 07:14:49,727 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 07:14:49,727 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-17 07:14:49,728 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:14:49,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 706 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:14:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 07:14:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-17 07:14:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 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), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-17 07:14:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 252 transitions. [2025-03-17 07:14:49,742 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 252 transitions. Word has length 77 [2025-03-17 07:14:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:14:49,742 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 252 transitions. [2025-03-17 07:14:49,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (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-17 07:14:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 252 transitions. [2025-03-17 07:14:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 07:14:49,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:14:49,745 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] [2025-03-17 07:14:49,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 07:14:49,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:14:49,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:14:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1428811332, now seen corresponding path program 1 times [2025-03-17 07:14:49,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:14:49,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413493347] [2025-03-17 07:14:49,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:49,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:14:53,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 07:14:53,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 07:14:53,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:14:53,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:14:54,072 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-17 07:14:54,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:14:54,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413493347] [2025-03-17 07:14:54,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413493347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:14:54,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:14:54,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:14:54,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771157853] [2025-03-17 07:14:54,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:14:54,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:14:54,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:14:54,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:14:54,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:14:54,076 INFO L87 Difference]: Start difference. First operand 200 states and 252 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-17 07:14:58,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:14:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:14:59,001 INFO L93 Difference]: Finished difference Result 248 states and 305 transitions. [2025-03-17 07:14:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:14:59,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 81 [2025-03-17 07:14:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:14:59,005 INFO L225 Difference]: With dead ends: 248 [2025-03-17 07:14:59,006 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 07:14:59,006 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-17 07:14:59,007 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-17 07:14:59,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 708 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-17 07:14:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 07:14:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 196. [2025-03-17 07:14:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 137 states have (on average 1.2335766423357664) internal successors, (169), 138 states have internal predecessors, (169), 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-17 07:14:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 246 transitions. [2025-03-17 07:14:59,020 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 246 transitions. Word has length 81 [2025-03-17 07:14:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:14:59,020 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 246 transitions. [2025-03-17 07:14:59,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-17 07:14:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 246 transitions. [2025-03-17 07:14:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 07:14:59,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:14:59,022 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] [2025-03-17 07:14:59,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 07:14:59,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:14:59,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:14:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash 693337621, now seen corresponding path program 1 times [2025-03-17 07:14:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:14:59,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775826801] [2025-03-17 07:14:59,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:14:59,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:02,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 07:15:02,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 07:15:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:03,571 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-17 07:15:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775826801] [2025-03-17 07:15:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775826801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:03,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:03,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:15:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410785380] [2025-03-17 07:15:03,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:03,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:15:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:03,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:15:03,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:15:03,573 INFO L87 Difference]: Start difference. First operand 196 states and 246 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (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-17 07:15:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:04,164 INFO L93 Difference]: Finished difference Result 314 states and 386 transitions. [2025-03-17 07:15:04,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:15:04,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (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 99 [2025-03-17 07:15:04,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:04,169 INFO L225 Difference]: With dead ends: 314 [2025-03-17 07:15:04,169 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 07:15:04,169 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-17 07:15:04,170 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 932 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.6s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:04,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 932 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 07:15:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 07:15:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-17 07:15:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 142 states have internal predecessors, (173), 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-17 07:15:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 253 transitions. [2025-03-17 07:15:04,187 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 253 transitions. Word has length 99 [2025-03-17 07:15:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:04,187 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 253 transitions. [2025-03-17 07:15:04,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (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-17 07:15:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 253 transitions. [2025-03-17 07:15:04,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 07:15:04,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:04,192 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] [2025-03-17 07:15:04,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 07:15:04,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:04,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:04,193 INFO L85 PathProgramCache]: Analyzing trace with hash 918437690, now seen corresponding path program 1 times [2025-03-17 07:15:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:04,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141204188] [2025-03-17 07:15:04,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:07,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 07:15:07,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 07:15:07,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:07,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:09,951 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-17 07:15:09,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:09,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141204188] [2025-03-17 07:15:09,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141204188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:09,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:09,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:15:09,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601268146] [2025-03-17 07:15:09,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:09,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:15:09,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:09,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:15:09,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:15:09,954 INFO L87 Difference]: Start difference. First operand 201 states and 253 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-17 07:15:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:10,549 INFO L93 Difference]: Finished difference Result 256 states and 315 transitions. [2025-03-17 07:15:10,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:15:10,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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 104 [2025-03-17 07:15:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:10,551 INFO L225 Difference]: With dead ends: 256 [2025-03-17 07:15:10,551 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 07:15:10,551 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-17 07:15:10,552 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 936 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-17 07:15:10,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 936 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 07:15:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 07:15:10,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-17 07:15:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 141 states have (on average 1.2127659574468086) internal successors, (171), 142 states have internal predecessors, (171), 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-17 07:15:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 251 transitions. [2025-03-17 07:15:10,560 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 251 transitions. Word has length 104 [2025-03-17 07:15:10,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:10,560 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 251 transitions. [2025-03-17 07:15:10,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-17 07:15:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 251 transitions. [2025-03-17 07:15:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 07:15:10,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:10,566 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] [2025-03-17 07:15:10,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 07:15:10,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:10,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1520552902, now seen corresponding path program 1 times [2025-03-17 07:15:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718853122] [2025-03-17 07:15:10,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:10,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:14,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 07:15:14,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 07:15:14,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:14,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:14,943 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-17 07:15:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:14,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718853122] [2025-03-17 07:15:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718853122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:14,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:15:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160694749] [2025-03-17 07:15:14,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:15:14,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:14,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:15:14,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:15:14,946 INFO L87 Difference]: Start difference. First operand 201 states and 251 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-17 07:15:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:15,294 INFO L93 Difference]: Finished difference Result 317 states and 385 transitions. [2025-03-17 07:15:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:15:15,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 139 [2025-03-17 07:15:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:15,296 INFO L225 Difference]: With dead ends: 317 [2025-03-17 07:15:15,296 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 07:15:15,297 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-17 07:15:15,297 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 698 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-17 07:15:15,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 698 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:15:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 07:15:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2025-03-17 07:15:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 137 states have (on average 1.2043795620437956) internal successors, (165), 138 states have internal predecessors, (165), 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-17 07:15:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 242 transitions. [2025-03-17 07:15:15,309 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 242 transitions. Word has length 139 [2025-03-17 07:15:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:15,310 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 242 transitions. [2025-03-17 07:15:15,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-17 07:15:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 242 transitions. [2025-03-17 07:15:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 07:15:15,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:15,311 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] [2025-03-17 07:15:15,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 07:15:15,311 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:15,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash -234271994, now seen corresponding path program 1 times [2025-03-17 07:15:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:15,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034734821] [2025-03-17 07:15:15,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:15,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:18,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 07:15:19,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 07:15:19,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:19,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:19,811 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-17 07:15:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:19,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034734821] [2025-03-17 07:15:19,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034734821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:19,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:19,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:15:19,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601816369] [2025-03-17 07:15:19,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:19,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:15:19,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:19,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:15:19,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:15:19,813 INFO L87 Difference]: Start difference. First operand 196 states and 242 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-17 07:15:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:20,346 INFO L93 Difference]: Finished difference Result 258 states and 314 transitions. [2025-03-17 07:15:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:15:20,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 146 [2025-03-17 07:15:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:20,349 INFO L225 Difference]: With dead ends: 258 [2025-03-17 07:15:20,349 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 07:15:20,349 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-17 07:15:20,350 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 914 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.5s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:20,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 914 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 07:15:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 07:15:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-17 07:15:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 141 states have (on average 1.198581560283688) internal successors, (169), 142 states have internal predecessors, (169), 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-17 07:15:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 249 transitions. [2025-03-17 07:15:20,358 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 249 transitions. Word has length 146 [2025-03-17 07:15:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:20,358 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 249 transitions. [2025-03-17 07:15:20,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-17 07:15:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 249 transitions. [2025-03-17 07:15:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 07:15:20,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:20,359 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] [2025-03-17 07:15:20,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 07:15:20,360 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:20,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1879853869, now seen corresponding path program 1 times [2025-03-17 07:15:20,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:20,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238765683] [2025-03-17 07:15:20,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:20,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:23,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 07:15:24,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 07:15:24,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:24,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:24,929 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-17 07:15:24,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:24,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238765683] [2025-03-17 07:15:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238765683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:24,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:24,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:15:24,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246057321] [2025-03-17 07:15:24,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:24,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:15:24,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:24,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:15:24,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:15:24,930 INFO L87 Difference]: Start difference. First operand 201 states and 249 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-17 07:15:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:25,347 INFO L93 Difference]: Finished difference Result 258 states and 313 transitions. [2025-03-17 07:15:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:15:25,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 151 [2025-03-17 07:15:25,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:25,350 INFO L225 Difference]: With dead ends: 258 [2025-03-17 07:15:25,350 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 07:15:25,350 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-17 07:15:25,350 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 693 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.4s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:25,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 693 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 07:15:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 07:15:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2025-03-17 07:15:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 137 states have (on average 1.197080291970803) internal successors, (164), 138 states have internal predecessors, (164), 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-17 07:15:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 241 transitions. [2025-03-17 07:15:25,357 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 241 transitions. Word has length 151 [2025-03-17 07:15:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:25,357 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 241 transitions. [2025-03-17 07:15:25,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-17 07:15:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 241 transitions. [2025-03-17 07:15:25,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 07:15:25,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:25,359 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] [2025-03-17 07:15:25,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 07:15:25,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:25,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1509119065, now seen corresponding path program 1 times [2025-03-17 07:15:25,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:25,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122490047] [2025-03-17 07:15:25,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:25,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:29,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 07:15:29,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 07:15:29,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:29,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:30,708 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-17 07:15:30,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:30,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122490047] [2025-03-17 07:15:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122490047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:30,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:30,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:15:30,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263685855] [2025-03-17 07:15:30,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:30,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:15:30,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:30,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:15:30,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:15:30,709 INFO L87 Difference]: Start difference. First operand 196 states and 241 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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-17 07:15:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:31,482 INFO L93 Difference]: Finished difference Result 260 states and 313 transitions. [2025-03-17 07:15:31,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 07:15:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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 159 [2025-03-17 07:15:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:31,484 INFO L225 Difference]: With dead ends: 260 [2025-03-17 07:15:31,484 INFO L226 Difference]: Without dead ends: 202 [2025-03-17 07:15:31,485 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-17 07:15:31,485 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 2 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1131 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.8s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:31,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1131 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 07:15:31,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-17 07:15:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2025-03-17 07:15:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 141 states have (on average 1.1914893617021276) internal successors, (168), 142 states have internal predecessors, (168), 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-17 07:15:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2025-03-17 07:15:31,496 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 159 [2025-03-17 07:15:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:31,497 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2025-03-17 07:15:31,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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-17 07:15:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2025-03-17 07:15:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 07:15:31,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:31,499 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] [2025-03-17 07:15:31,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 07:15:31,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:31,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:31,500 INFO L85 PathProgramCache]: Analyzing trace with hash 325433155, now seen corresponding path program 1 times [2025-03-17 07:15:31,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:31,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795908239] [2025-03-17 07:15:31,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:35,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 07:15:35,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 07:15:35,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:35,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:37,730 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-17 07:15:37,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:37,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795908239] [2025-03-17 07:15:37,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795908239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:37,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:37,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 07:15:37,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961610632] [2025-03-17 07:15:37,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:37,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:15:37,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:37,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:15:37,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:15:37,732 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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-17 07:15:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:39,320 INFO L93 Difference]: Finished difference Result 259 states and 311 transitions. [2025-03-17 07:15:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:15:39,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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 164 [2025-03-17 07:15:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:39,325 INFO L225 Difference]: With dead ends: 259 [2025-03-17 07:15:39,325 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 07:15:39,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:15:39,326 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1580 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.6s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:39,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1580 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 07:15:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 07:15:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-17 07:15:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 136 states have (on average 1.1838235294117647) internal successors, (161), 137 states have internal predecessors, (161), 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-17 07:15:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2025-03-17 07:15:39,336 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 164 [2025-03-17 07:15:39,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:39,339 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2025-03-17 07:15:39,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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-17 07:15:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2025-03-17 07:15:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 07:15:39,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:39,342 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] [2025-03-17 07:15:39,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 07:15:39,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:39,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash -633757366, now seen corresponding path program 1 times [2025-03-17 07:15:39,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:39,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789950827] [2025-03-17 07:15:39,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:39,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:43,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 07:15:43,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 07:15:43,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:43,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:49,119 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-17 07:15:49,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:49,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789950827] [2025-03-17 07:15:49,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789950827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:49,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:49,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 07:15:49,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211051554] [2025-03-17 07:15:49,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:49,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 07:15:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:49,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 07:15:49,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-03-17 07:15:49,121 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 14 states have internal predecessors, (80), 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)