./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 32bit --witnessprinter.graph.data.programhash 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:58:59,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:58:59,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 04:58:59,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:58:59,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:58:59,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:58:59,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:58:59,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:58:59,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:58:59,480 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:58:59,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:58:59,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:58:59,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:58:59,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:58:59,481 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:58:59,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:58:59,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:58:59,482 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:58:59,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:58:59,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:58:59,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:58:59,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:58:59,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:58:59,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:58:59,483 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:58:59,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:58:59,483 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:58:59,483 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:58:59,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:58:59,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:58:59,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:58:59,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:58:59,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:58:59,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:58:59,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:58:59,485 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:58:59,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:58:59,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:58:59,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:58:59,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:58:59,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:58:59,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:58:59,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:58:59,486 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-jdk21/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b [2025-02-08 04:58:59,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:58:59,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:58:59,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:58:59,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:58:59,788 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:58:59,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2025-02-08 04:59:01,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20006f23d/9c59b413d4314eb69d7b22d14cedda34/FLAG7f01e36d9 [2025-02-08 04:59:01,548 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:59:01,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2025-02-08 04:59:01,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20006f23d/9c59b413d4314eb69d7b22d14cedda34/FLAG7f01e36d9 [2025-02-08 04:59:01,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20006f23d/9c59b413d4314eb69d7b22d14cedda34 [2025-02-08 04:59:01,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:59:01,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:59:01,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:59:01,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:59:01,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:59:01,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:59:01" (1/1) ... [2025-02-08 04:59:01,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474ef4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:01, skipping insertion in model container [2025-02-08 04:59:01,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:59:01" (1/1) ... [2025-02-08 04:59:01,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:59:01,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[33021,33034] [2025-02-08 04:59:02,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44124,44137] [2025-02-08 04:59:02,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44245,44258] [2025-02-08 04:59:02,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:59:02,110 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:59:02,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[33021,33034] [2025-02-08 04:59:02,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44124,44137] [2025-02-08 04:59:02,222 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44245,44258] [2025-02-08 04:59:02,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:59:02,261 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:59:02,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02 WrapperNode [2025-02-08 04:59:02,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:59:02,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:59:02,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:59:02,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:59:02,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,360 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1537 [2025-02-08 04:59:02,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:59:02,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:59:02,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:59:02,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:59:02,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,489 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [34, 2, 265]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 62 writes are split as follows [4, 0, 58]. [2025-02-08 04:59:02,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,537 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:59:02,580 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:59:02,580 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:59:02,580 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:59:02,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (1/1) ... [2025-02-08 04:59:02,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:59:02,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:02,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 04:59:02,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 04:59:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:59:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:59:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:59:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:59:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:59:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:59:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:59:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:59:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:59:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:59:02,849 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:59:02,850 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:59:04,313 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 04:59:04,413 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-02-08 04:59:04,413 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:59:04,478 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:59:04,478 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 04:59:04,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:59:04 BoogieIcfgContainer [2025-02-08 04:59:04,479 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:59:04,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:59:04,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:59:04,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:59:04,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:59:01" (1/3) ... [2025-02-08 04:59:04,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adf32e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:59:04, skipping insertion in model container [2025-02-08 04:59:04,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:59:02" (2/3) ... [2025-02-08 04:59:04,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adf32e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:59:04, skipping insertion in model container [2025-02-08 04:59:04,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:59:04" (3/3) ... [2025-02-08 04:59:04,487 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test7-2.i [2025-02-08 04:59:04,501 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:59:04,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test7-2.i that has 4 procedures, 431 locations, 1 initial locations, 43 loop locations, and 2 error locations. [2025-02-08 04:59:04,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:59:04,584 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;@71180a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:59:04,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 04:59:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 423 states, 416 states have (on average 1.6225961538461537) internal successors, (675), 418 states have internal predecessors, (675), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 04:59:04,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:04,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:59:04,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:04,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash -692763222, now seen corresponding path program 1 times [2025-02-08 04:59:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:04,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619076837] [2025-02-08 04:59:04,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:04,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:04,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 04:59:04,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 04:59:04,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:04,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:59:04,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:04,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619076837] [2025-02-08 04:59:04,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619076837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:04,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:59:04,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688833252] [2025-02-08 04:59:04,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:04,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:59:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:04,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:59:04,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:59:04,788 INFO L87 Difference]: Start difference. First operand has 423 states, 416 states have (on average 1.6225961538461537) internal successors, (675), 418 states have internal predecessors, (675), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:59:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:04,907 INFO L93 Difference]: Finished difference Result 845 states and 1361 transitions. [2025-02-08 04:59:04,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:59:04,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 04:59:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:04,921 INFO L225 Difference]: With dead ends: 845 [2025-02-08 04:59:04,923 INFO L226 Difference]: Without dead ends: 387 [2025-02-08 04:59:04,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-02-08 04:59:04,931 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 566 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:04,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 566 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:59:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-08 04:59:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-02-08 04:59:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 381 states have (on average 1.4540682414698163) internal successors, (554), 382 states have internal predecessors, (554), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 560 transitions. [2025-02-08 04:59:04,989 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 560 transitions. Word has length 7 [2025-02-08 04:59:04,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:04,989 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 560 transitions. [2025-02-08 04:59:04,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:59:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 560 transitions. [2025-02-08 04:59:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 04:59:04,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:04,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:59:04,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:59:04,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2046307096, now seen corresponding path program 1 times [2025-02-08 04:59:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727968164] [2025-02-08 04:59:04,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:05,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 04:59:05,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 04:59:05,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:05,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:59:05,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:05,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727968164] [2025-02-08 04:59:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727968164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:05,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:59:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137756717] [2025-02-08 04:59:05,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:05,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:05,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:05,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:05,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:05,203 INFO L87 Difference]: Start difference. First operand 387 states and 560 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:59:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:05,520 INFO L93 Difference]: Finished difference Result 957 states and 1388 transitions. [2025-02-08 04:59:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:59:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 04:59:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:05,526 INFO L225 Difference]: With dead ends: 957 [2025-02-08 04:59:05,526 INFO L226 Difference]: Without dead ends: 768 [2025-02-08 04:59:05,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:59:05,529 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 545 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:05,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1491 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:59:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-02-08 04:59:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 389. [2025-02-08 04:59:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 383 states have (on average 1.4516971279373367) internal successors, (556), 384 states have internal predecessors, (556), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 562 transitions. [2025-02-08 04:59:05,567 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 562 transitions. Word has length 9 [2025-02-08 04:59:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:05,567 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 562 transitions. [2025-02-08 04:59:05,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:59:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 562 transitions. [2025-02-08 04:59:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 04:59:05,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:05,572 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:59:05,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:59:05,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:05,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1765994817, now seen corresponding path program 1 times [2025-02-08 04:59:05,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:05,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391741717] [2025-02-08 04:59:05,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:05,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:05,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 04:59:05,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 04:59:05,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:05,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:59:06,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:06,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391741717] [2025-02-08 04:59:06,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391741717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:06,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:06,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:59:06,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266906565] [2025-02-08 04:59:06,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:06,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:06,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:06,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:06,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:06,034 INFO L87 Difference]: Start difference. First operand 389 states and 562 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:59:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:06,216 INFO L93 Difference]: Finished difference Result 733 states and 1055 transitions. [2025-02-08 04:59:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:59:06,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 04:59:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:06,219 INFO L225 Difference]: With dead ends: 733 [2025-02-08 04:59:06,219 INFO L226 Difference]: Without dead ends: 347 [2025-02-08 04:59:06,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:59:06,220 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 36 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:06,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1255 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:59:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-08 04:59:06,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-02-08 04:59:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 341 states have (on average 1.404692082111437) internal successors, (479), 342 states have internal predecessors, (479), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 485 transitions. [2025-02-08 04:59:06,240 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 485 transitions. Word has length 84 [2025-02-08 04:59:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:06,241 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 485 transitions. [2025-02-08 04:59:06,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:59:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 485 transitions. [2025-02-08 04:59:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 04:59:06,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:06,245 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:59:06,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:59:06,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:06,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash -492632503, now seen corresponding path program 1 times [2025-02-08 04:59:06,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:06,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747164548] [2025-02-08 04:59:06,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:06,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:06,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 04:59:06,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 04:59:06,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:06,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:59:06,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:06,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747164548] [2025-02-08 04:59:06,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747164548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:06,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:06,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:59:06,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214702898] [2025-02-08 04:59:06,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:06,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:06,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:06,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:06,485 INFO L87 Difference]: Start difference. First operand 347 states and 485 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:59:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:06,618 INFO L93 Difference]: Finished difference Result 685 states and 961 transitions. [2025-02-08 04:59:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:59:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 04:59:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:06,621 INFO L225 Difference]: With dead ends: 685 [2025-02-08 04:59:06,621 INFO L226 Difference]: Without dead ends: 341 [2025-02-08 04:59:06,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:59:06,622 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 9 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:06,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1256 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:59:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-02-08 04:59:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-02-08 04:59:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 335 states have (on average 1.4) internal successors, (469), 336 states have internal predecessors, (469), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 475 transitions. [2025-02-08 04:59:06,638 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 475 transitions. Word has length 84 [2025-02-08 04:59:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:06,638 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 475 transitions. [2025-02-08 04:59:06,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:59:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 475 transitions. [2025-02-08 04:59:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 04:59:06,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:06,642 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:59:06,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:59:06,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:06,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash -930137403, now seen corresponding path program 1 times [2025-02-08 04:59:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276983630] [2025-02-08 04:59:06,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:06,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 04:59:06,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 04:59:06,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:06,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:59:06,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276983630] [2025-02-08 04:59:06,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276983630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:06,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:06,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:59:06,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324063029] [2025-02-08 04:59:06,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:06,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:59:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:06,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:59:06,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:59:06,848 INFO L87 Difference]: Start difference. First operand 341 states and 475 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:59:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:07,045 INFO L93 Difference]: Finished difference Result 925 states and 1298 transitions. [2025-02-08 04:59:07,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:59:07,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-08 04:59:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:07,050 INFO L225 Difference]: With dead ends: 925 [2025-02-08 04:59:07,051 INFO L226 Difference]: Without dead ends: 587 [2025-02-08 04:59:07,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:59:07,052 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 293 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:07,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1025 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:59:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-08 04:59:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 580. [2025-02-08 04:59:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 574 states have (on average 1.416376306620209) internal successors, (813), 575 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 819 transitions. [2025-02-08 04:59:07,088 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 819 transitions. Word has length 84 [2025-02-08 04:59:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:07,089 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 819 transitions. [2025-02-08 04:59:07,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:59:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 819 transitions. [2025-02-08 04:59:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 04:59:07,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:07,093 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 04:59:07,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:59:07,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1220183112, now seen corresponding path program 1 times [2025-02-08 04:59:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:07,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439490674] [2025-02-08 04:59:07,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:07,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:07,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 04:59:07,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 04:59:07,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:07,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:59:07,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:07,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439490674] [2025-02-08 04:59:07,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439490674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:07,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:07,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:59:07,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174915115] [2025-02-08 04:59:07,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:07,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:07,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:07,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:07,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:07,582 INFO L87 Difference]: Start difference. First operand 580 states and 819 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:07,788 INFO L93 Difference]: Finished difference Result 860 states and 1215 transitions. [2025-02-08 04:59:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:59:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-02-08 04:59:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:07,793 INFO L225 Difference]: With dead ends: 860 [2025-02-08 04:59:07,793 INFO L226 Difference]: Without dead ends: 856 [2025-02-08 04:59:07,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:59:07,794 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 451 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:07,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1335 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:59:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-02-08 04:59:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 582. [2025-02-08 04:59:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 576 states have (on average 1.4149305555555556) internal successors, (815), 577 states have internal predecessors, (815), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 821 transitions. [2025-02-08 04:59:07,820 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 821 transitions. Word has length 99 [2025-02-08 04:59:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:07,820 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 821 transitions. [2025-02-08 04:59:07,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 821 transitions. [2025-02-08 04:59:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 04:59:07,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:07,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:59:07,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:59:07,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:07,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash -419417919, now seen corresponding path program 1 times [2025-02-08 04:59:07,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255628735] [2025-02-08 04:59:07,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:07,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:07,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 04:59:07,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 04:59:07,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:07,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:59:08,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:08,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255628735] [2025-02-08 04:59:08,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255628735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:08,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:08,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:59:08,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654760057] [2025-02-08 04:59:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:08,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:08,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:08,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:08,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:08,136 INFO L87 Difference]: Start difference. First operand 582 states and 821 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:08,268 INFO L93 Difference]: Finished difference Result 845 states and 1199 transitions. [2025-02-08 04:59:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:59:08,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2025-02-08 04:59:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:08,272 INFO L225 Difference]: With dead ends: 845 [2025-02-08 04:59:08,272 INFO L226 Difference]: Without dead ends: 498 [2025-02-08 04:59:08,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:59:08,277 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 30 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:08,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1025 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:59:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-02-08 04:59:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-02-08 04:59:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 492 states have (on average 1.3434959349593496) internal successors, (661), 493 states have internal predecessors, (661), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 667 transitions. [2025-02-08 04:59:08,297 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 667 transitions. Word has length 152 [2025-02-08 04:59:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:08,298 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 667 transitions. [2025-02-08 04:59:08,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 667 transitions. [2025-02-08 04:59:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 04:59:08,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:08,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:59:08,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 04:59:08,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:08,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1639752315, now seen corresponding path program 1 times [2025-02-08 04:59:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:08,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149163778] [2025-02-08 04:59:08,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:08,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 04:59:08,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 04:59:08,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:08,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:59:08,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149163778] [2025-02-08 04:59:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149163778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:08,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:59:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981191061] [2025-02-08 04:59:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:08,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:08,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:08,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:08,609 INFO L87 Difference]: Start difference. First operand 498 states and 667 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:08,910 INFO L93 Difference]: Finished difference Result 1058 states and 1419 transitions. [2025-02-08 04:59:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:59:08,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2025-02-08 04:59:08,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:08,915 INFO L225 Difference]: With dead ends: 1058 [2025-02-08 04:59:08,915 INFO L226 Difference]: Without dead ends: 643 [2025-02-08 04:59:08,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:59:08,916 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 790 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:08,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 701 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:59:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-02-08 04:59:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 636. [2025-02-08 04:59:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 630 states have (on average 1.3476190476190477) internal successors, (849), 631 states have internal predecessors, (849), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:59:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 855 transitions. [2025-02-08 04:59:08,939 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 855 transitions. Word has length 152 [2025-02-08 04:59:08,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:08,939 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 855 transitions. [2025-02-08 04:59:08,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 855 transitions. [2025-02-08 04:59:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-08 04:59:08,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:08,943 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 04:59:08,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 04:59:08,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:08,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:08,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1354071501, now seen corresponding path program 1 times [2025-02-08 04:59:08,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:08,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450654817] [2025-02-08 04:59:08,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:08,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:08,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 04:59:09,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 04:59:09,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:09,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:59:09,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:09,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450654817] [2025-02-08 04:59:09,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450654817] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:59:09,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385196872] [2025-02-08 04:59:09,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:09,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:09,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:09,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:59:09,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 04:59:10,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 04:59:10,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 04:59:10,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:10,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:10,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 04:59:10,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:59:10,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:59:10,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:59:10,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:59:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:59:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385196872] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:59:10,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:59:10,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-02-08 04:59:10,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543496564] [2025-02-08 04:59:10,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:59:10,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 04:59:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:10,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 04:59:10,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:59:10,663 INFO L87 Difference]: Start difference. First operand 636 states and 855 transitions. Second operand has 12 states, 12 states have (on average 26.833333333333332) internal successors, (322), 12 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:59:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:11,334 INFO L93 Difference]: Finished difference Result 2872 states and 3878 transitions. [2025-02-08 04:59:11,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:59:11,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.833333333333332) internal successors, (322), 12 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 162 [2025-02-08 04:59:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:11,347 INFO L225 Difference]: With dead ends: 2872 [2025-02-08 04:59:11,347 INFO L226 Difference]: Without dead ends: 2468 [2025-02-08 04:59:11,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 316 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-08 04:59:11,350 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 1319 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 4787 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:11,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 4787 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:59:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2025-02-08 04:59:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 966. [2025-02-08 04:59:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 956 states have (on average 1.3399581589958158) internal successors, (1281), 957 states have internal predecessors, (1281), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:59:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1293 transitions. [2025-02-08 04:59:11,414 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1293 transitions. Word has length 162 [2025-02-08 04:59:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:11,414 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1293 transitions. [2025-02-08 04:59:11,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.833333333333332) internal successors, (322), 12 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:59:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1293 transitions. [2025-02-08 04:59:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-08 04:59:11,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:11,420 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-02-08 04:59:11,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 04:59:11,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:11,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:11,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash 118879936, now seen corresponding path program 1 times [2025-02-08 04:59:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:11,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311112797] [2025-02-08 04:59:11,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:11,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:11,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-08 04:59:11,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-08 04:59:11,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:11,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:59:14,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:14,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311112797] [2025-02-08 04:59:14,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311112797] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:59:14,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674408254] [2025-02-08 04:59:14,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:14,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:14,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:14,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:59:14,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 04:59:15,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-08 04:59:15,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-08 04:59:15,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:15,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:15,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 04:59:15,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:59:15,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:59:15,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:16,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:16,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:16,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:59:16,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:59:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:59:16,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674408254] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:59:16,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:59:16,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2025-02-08 04:59:16,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943596470] [2025-02-08 04:59:16,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:59:16,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 04:59:16,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:16,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 04:59:16,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-02-08 04:59:16,887 INFO L87 Difference]: Start difference. First operand 966 states and 1293 transitions. Second operand has 24 states, 24 states have (on average 41.541666666666664) internal successors, (997), 24 states have internal predecessors, (997), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:59:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:18,765 INFO L93 Difference]: Finished difference Result 6094 states and 8237 transitions. [2025-02-08 04:59:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 04:59:18,766 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 41.541666666666664) internal successors, (997), 24 states have internal predecessors, (997), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 387 [2025-02-08 04:59:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:18,792 INFO L225 Difference]: With dead ends: 6094 [2025-02-08 04:59:18,793 INFO L226 Difference]: Without dead ends: 5690 [2025-02-08 04:59:18,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 763 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 04:59:18,798 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 5298 mSDsluCounter, 15213 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5308 SdHoareTripleChecker+Valid, 16901 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:18,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5308 Valid, 16901 Invalid, 1888 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 04:59:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2025-02-08 04:59:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 1782. [2025-02-08 04:59:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1766 states have (on average 1.3335220838052095) internal successors, (2355), 1767 states have internal predecessors, (2355), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:59:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2379 transitions. [2025-02-08 04:59:18,905 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2379 transitions. Word has length 387 [2025-02-08 04:59:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:18,905 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2379 transitions. [2025-02-08 04:59:18,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 41.541666666666664) internal successors, (997), 24 states have internal predecessors, (997), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:59:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2379 transitions. [2025-02-08 04:59:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2025-02-08 04:59:18,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:18,926 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-02-08 04:59:18,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 04:59:19,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:19,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:19,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1865306208, now seen corresponding path program 2 times [2025-02-08 04:59:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:19,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547012794] [2025-02-08 04:59:19,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:59:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:19,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 837 statements into 2 equivalence classes. [2025-02-08 04:59:19,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 837 statements. [2025-02-08 04:59:19,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:59:19,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-08 04:59:19,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:19,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547012794] [2025-02-08 04:59:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547012794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:19,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:19,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:59:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38812763] [2025-02-08 04:59:19,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:19,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:59:19,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:19,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:59:19,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:59:19,610 INFO L87 Difference]: Start difference. First operand 1782 states and 2379 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:20,045 INFO L93 Difference]: Finished difference Result 2198 states and 2948 transitions. [2025-02-08 04:59:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:59:20,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 837 [2025-02-08 04:59:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:20,058 INFO L225 Difference]: With dead ends: 2198 [2025-02-08 04:59:20,058 INFO L226 Difference]: Without dead ends: 1797 [2025-02-08 04:59:20,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:59:20,060 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 14 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:20,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1501 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:59:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2025-02-08 04:59:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1788. [2025-02-08 04:59:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1772 states have (on average 1.332392776523702) internal successors, (2361), 1773 states have internal predecessors, (2361), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:59:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2385 transitions. [2025-02-08 04:59:20,123 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2385 transitions. Word has length 837 [2025-02-08 04:59:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:20,124 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2385 transitions. [2025-02-08 04:59:20,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2385 transitions. [2025-02-08 04:59:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-08 04:59:20,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:20,144 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-02-08 04:59:20,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 04:59:20,144 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:20,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:20,145 INFO L85 PathProgramCache]: Analyzing trace with hash -344372517, now seen corresponding path program 1 times [2025-02-08 04:59:20,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:20,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840054013] [2025-02-08 04:59:20,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:20,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-02-08 04:59:20,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-02-08 04:59:20,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:20,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:59:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840054013] [2025-02-08 04:59:30,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840054013] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:59:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965839569] [2025-02-08 04:59:30,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:30,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:30,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:59:30,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:59:30,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 04:59:30,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-02-08 04:59:31,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-02-08 04:59:31,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:31,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:31,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 4159 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 04:59:31,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:59:31,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:59:31,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:31,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:32,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:32,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:32,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:32,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:32,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:32,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:32,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:32,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 04:59:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:59:32,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:59:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:59:33,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965839569] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:59:33,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:59:33,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 48 [2025-02-08 04:59:33,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783878349] [2025-02-08 04:59:33,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:59:33,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 04:59:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:33,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 04:59:33,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=1501, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 04:59:33,851 INFO L87 Difference]: Start difference. First operand 1788 states and 2385 transitions. Second operand has 48 states, 48 states have (on average 48.916666666666664) internal successors, (2348), 48 states have internal predecessors, (2348), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:59:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:38,020 INFO L93 Difference]: Finished difference Result 12678 states and 17095 transitions. [2025-02-08 04:59:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-08 04:59:38,021 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 48.916666666666664) internal successors, (2348), 48 states have internal predecessors, (2348), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 838 [2025-02-08 04:59:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:38,076 INFO L225 Difference]: With dead ends: 12678 [2025-02-08 04:59:38,076 INFO L226 Difference]: Without dead ends: 12268 [2025-02-08 04:59:38,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1729 GetRequests, 1659 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1389, Invalid=3303, Unknown=0, NotChecked=0, Total=4692 [2025-02-08 04:59:38,089 INFO L435 NwaCegarLoop]: 3704 mSDtfsCounter, 19022 mSDsluCounter, 49991 mSDsCounter, 0 mSdLazyCounter, 5793 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19044 SdHoareTripleChecker+Valid, 53695 SdHoareTripleChecker+Invalid, 5887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 5793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:38,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19044 Valid, 53695 Invalid, 5887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [94 Valid, 5793 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-08 04:59:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12268 states. [2025-02-08 04:59:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12268 to 3420. [2025-02-08 04:59:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3420 states, 3392 states have (on average 1.3293042452830188) internal successors, (4509), 3393 states have internal predecessors, (4509), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 04:59:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 4557 transitions. [2025-02-08 04:59:38,279 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 4557 transitions. Word has length 838 [2025-02-08 04:59:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:38,281 INFO L471 AbstractCegarLoop]: Abstraction has 3420 states and 4557 transitions. [2025-02-08 04:59:38,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 48.916666666666664) internal successors, (2348), 48 states have internal predecessors, (2348), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:59:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 4557 transitions. [2025-02-08 04:59:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1739 [2025-02-08 04:59:38,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:38,336 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-08 04:59:38,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 04:59:38,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:59:38,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:38,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash 912177051, now seen corresponding path program 2 times [2025-02-08 04:59:38,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:38,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030796223] [2025-02-08 04:59:38,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:59:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:39,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1738 statements into 2 equivalence classes. [2025-02-08 04:59:39,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 1738 statements. [2025-02-08 04:59:39,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:59:39,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-08 04:59:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030796223] [2025-02-08 04:59:39,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030796223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:39,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:39,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:59:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533414441] [2025-02-08 04:59:39,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:39,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:59:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:39,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:59:39,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:39,191 INFO L87 Difference]: Start difference. First operand 3420 states and 4557 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:39,383 INFO L93 Difference]: Finished difference Result 3827 states and 5108 transitions. [2025-02-08 04:59:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:59:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1738 [2025-02-08 04:59:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:39,395 INFO L225 Difference]: With dead ends: 3827 [2025-02-08 04:59:39,395 INFO L226 Difference]: Without dead ends: 3420 [2025-02-08 04:59:39,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:59:39,398 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 17 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:39,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 956 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:59:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2025-02-08 04:59:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 3420. [2025-02-08 04:59:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3420 states, 3392 states have (on average 1.3284198113207548) internal successors, (4506), 3393 states have internal predecessors, (4506), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 04:59:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 4554 transitions. [2025-02-08 04:59:39,499 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 4554 transitions. Word has length 1738 [2025-02-08 04:59:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:39,502 INFO L471 AbstractCegarLoop]: Abstraction has 3420 states and 4554 transitions. [2025-02-08 04:59:39,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 4554 transitions. [2025-02-08 04:59:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1739 [2025-02-08 04:59:39,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:39,524 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-08 04:59:39,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 04:59:39,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:39,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash -186619422, now seen corresponding path program 1 times [2025-02-08 04:59:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932762889] [2025-02-08 04:59:39,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:40,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1738 statements into 1 equivalence classes. [2025-02-08 04:59:41,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1738 of 1738 statements. [2025-02-08 04:59:41,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:41,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-08 04:59:44,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:44,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932762889] [2025-02-08 04:59:44,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932762889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:44,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:44,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:59:44,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798626474] [2025-02-08 04:59:44,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:44,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:59:44,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:44,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:59:44,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:59:44,156 INFO L87 Difference]: Start difference. First operand 3420 states and 4554 transitions. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:44,465 INFO L93 Difference]: Finished difference Result 3842 states and 5126 transitions. [2025-02-08 04:59:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:59:44,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1738 [2025-02-08 04:59:44,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:44,477 INFO L225 Difference]: With dead ends: 3842 [2025-02-08 04:59:44,478 INFO L226 Difference]: Without dead ends: 3435 [2025-02-08 04:59:44,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:59:44,481 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 14 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:44,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1802 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:59:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2025-02-08 04:59:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3432. [2025-02-08 04:59:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3432 states, 3404 states have (on average 1.3281433607520563) internal successors, (4521), 3405 states have internal predecessors, (4521), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 04:59:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4569 transitions. [2025-02-08 04:59:44,596 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4569 transitions. Word has length 1738 [2025-02-08 04:59:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:44,597 INFO L471 AbstractCegarLoop]: Abstraction has 3432 states and 4569 transitions. [2025-02-08 04:59:44,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4569 transitions. [2025-02-08 04:59:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1740 [2025-02-08 04:59:44,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:44,621 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-08 04:59:44,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 04:59:44,622 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:44,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:44,624 INFO L85 PathProgramCache]: Analyzing trace with hash 622518403, now seen corresponding path program 1 times [2025-02-08 04:59:44,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:44,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405324992] [2025-02-08 04:59:44,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:45,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1739 statements into 1 equivalence classes. [2025-02-08 04:59:46,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1739 of 1739 statements. [2025-02-08 04:59:46,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:46,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-08 04:59:48,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:48,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405324992] [2025-02-08 04:59:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405324992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:48,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:48,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:59:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190343910] [2025-02-08 04:59:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:59:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:48,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:59:48,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:59:48,892 INFO L87 Difference]: Start difference. First operand 3432 states and 4569 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:49,207 INFO L93 Difference]: Finished difference Result 3860 states and 5147 transitions. [2025-02-08 04:59:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:59:49,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1739 [2025-02-08 04:59:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:49,219 INFO L225 Difference]: With dead ends: 3860 [2025-02-08 04:59:49,219 INFO L226 Difference]: Without dead ends: 3441 [2025-02-08 04:59:49,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:59:49,224 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 8 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:49,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1522 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:59:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2025-02-08 04:59:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3441. [2025-02-08 04:59:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3441 states, 3413 states have (on average 1.3272780544975096) internal successors, (4530), 3414 states have internal predecessors, (4530), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 04:59:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 4578 transitions. [2025-02-08 04:59:49,325 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 4578 transitions. Word has length 1739 [2025-02-08 04:59:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:49,326 INFO L471 AbstractCegarLoop]: Abstraction has 3441 states and 4578 transitions. [2025-02-08 04:59:49,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4578 transitions. [2025-02-08 04:59:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1740 [2025-02-08 04:59:49,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:49,348 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-08 04:59:49,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 04:59:49,349 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:49,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash -57431065, now seen corresponding path program 1 times [2025-02-08 04:59:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:49,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623932975] [2025-02-08 04:59:49,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:49,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:49,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1739 statements into 1 equivalence classes. [2025-02-08 04:59:50,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1739 of 1739 statements. [2025-02-08 04:59:50,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:50,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:59:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-08 04:59:54,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:59:54,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623932975] [2025-02-08 04:59:54,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623932975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:59:54,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:59:54,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 04:59:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435569499] [2025-02-08 04:59:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:59:54,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 04:59:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:59:54,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 04:59:54,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:59:54,269 INFO L87 Difference]: Start difference. First operand 3441 states and 4578 transitions. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:59:54,740 INFO L93 Difference]: Finished difference Result 3908 states and 5213 transitions. [2025-02-08 04:59:54,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:59:54,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1739 [2025-02-08 04:59:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:59:54,750 INFO L225 Difference]: With dead ends: 3908 [2025-02-08 04:59:54,750 INFO L226 Difference]: Without dead ends: 3480 [2025-02-08 04:59:54,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:59:54,753 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 33 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:59:54,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2446 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:59:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2025-02-08 04:59:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3471. [2025-02-08 04:59:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3471 states, 3443 states have (on average 1.32791170490851) internal successors, (4572), 3444 states have internal predecessors, (4572), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 04:59:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 4620 transitions. [2025-02-08 04:59:54,889 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 4620 transitions. Word has length 1739 [2025-02-08 04:59:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:59:54,891 INFO L471 AbstractCegarLoop]: Abstraction has 3471 states and 4620 transitions. [2025-02-08 04:59:54,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:59:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 4620 transitions. [2025-02-08 04:59:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1740 [2025-02-08 04:59:54,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:59:54,975 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-08 04:59:54,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 04:59:54,975 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:59:54,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:59:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash 730770979, now seen corresponding path program 1 times [2025-02-08 04:59:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:59:54,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490499899] [2025-02-08 04:59:54,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:59:54,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:59:55,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1739 statements into 1 equivalence classes. [2025-02-08 04:59:56,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1739 of 1739 statements. [2025-02-08 04:59:56,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:59:56,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat