./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_SFH_nondet_test2-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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:56:38,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:56:39,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:56:39,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:56:39,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:56:39,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:56:39,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:56:39,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:56:39,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:56:39,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:56:39,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:56:39,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:56:39,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:56:39,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:56:39,072 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:56:39,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:56:39,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:56:39,072 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:56:39,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:56:39,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:56:39,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:56:39,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:56:39,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:56:39,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:56:39,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:56:39,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:56:39,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:56:39,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:56:39,073 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:56:39,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:56:39,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:56:39,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:56:39,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:56:39,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:56:39,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:56:39,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:56:39,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:56:39,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:56:39,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:56:39,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:56:39,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:56:39,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:56:39,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:56:39,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:56:39,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:56:39,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:56:39,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:56:39,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:56:39,075 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2025-01-09 20:56:39,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:56:39,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:56:39,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:56:39,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:56:39,324 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:56:39,325 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_SFH_nondet_test2-2.i [2025-01-09 20:56:40,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b01ba9ea5/3465add3cf1841068b6982b25189fdaf/FLAGcfe7ba13c [2025-01-09 20:56:40,880 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:56:40,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-2.i [2025-01-09 20:56:40,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b01ba9ea5/3465add3cf1841068b6982b25189fdaf/FLAGcfe7ba13c [2025-01-09 20:56:40,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b01ba9ea5/3465add3cf1841068b6982b25189fdaf [2025-01-09 20:56:40,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:56:40,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:56:40,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:56:40,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:56:40,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:56:40,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:56:40" (1/1) ... [2025-01-09 20:56:40,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25dc54e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:40, skipping insertion in model container [2025-01-09 20:56:40,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:56:40" (1/1) ... [2025-01-09 20:56:40,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:56:41,240 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_SFH_nondet_test2-2.i[37435,37448] [2025-01-09 20:56:41,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:56:41,327 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:56:41,359 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_SFH_nondet_test2-2.i[37435,37448] [2025-01-09 20:56:41,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:56:41,446 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:56:41,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41 WrapperNode [2025-01-09 20:56:41,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:56:41,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:56:41,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:56:41,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:56:41,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,512 INFO L138 Inliner]: procedures = 207, calls = 272, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1398 [2025-01-09 20:56:41,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:56:41,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:56:41,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:56:41,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:56:41,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,597 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-01-09 20:56:41,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:56:41,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:56:41,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:56:41,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:56:41,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (1/1) ... [2025-01-09 20:56:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:56:41,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:56:41,713 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-01-09 20:56:41,716 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-01-09 20:56:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:56:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:56:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:56:41,740 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:56:41,740 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:56:41,740 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:56:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:56:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:56:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:56:41,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:56:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:56:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:56:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:56:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:56:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:56:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:56:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:56:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:56:41,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:56:41,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:56:41,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:56:41,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:56:41,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:56:41,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:56:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:56:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:56:41,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:56:41,911 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:56:41,913 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:56:43,027 INFO L? ?]: Removed 320 outVars from TransFormulas that were not future-live. [2025-01-09 20:56:43,028 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:56:43,049 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:56:43,049 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-09 20:56:43,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:56:43 BoogieIcfgContainer [2025-01-09 20:56:43,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:56:43,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:56:43,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:56:43,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:56:43,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:56:40" (1/3) ... [2025-01-09 20:56:43,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f687457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:56:43, skipping insertion in model container [2025-01-09 20:56:43,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:56:41" (2/3) ... [2025-01-09 20:56:43,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f687457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:56:43, skipping insertion in model container [2025-01-09 20:56:43,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:56:43" (3/3) ... [2025-01-09 20:56:43,056 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-2.i [2025-01-09 20:56:43,065 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:56:43,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test2-2.i that has 4 procedures, 405 locations, 1 initial locations, 38 loop locations, and 1 error locations. [2025-01-09 20:56:43,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:56:43,116 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;@60b002a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:56:43,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 20:56:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 391 states have (on average 1.6138107416879794) internal successors, (631), 392 states have internal predecessors, (631), 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-01-09 20:56:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 20:56:43,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:43,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:56:43,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:43,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1494204060, now seen corresponding path program 1 times [2025-01-09 20:56:43,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:43,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591706601] [2025-01-09 20:56:43,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:43,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 20:56:43,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 20:56:43,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:43,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:56:43,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:43,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591706601] [2025-01-09 20:56:43,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591706601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:43,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:43,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:56:43,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676710680] [2025-01-09 20:56:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:43,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:56:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:43,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:56:43,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:56:43,302 INFO L87 Difference]: Start difference. First operand has 397 states, 391 states have (on average 1.6138107416879794) internal successors, (631), 392 states have internal predecessors, (631), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-01-09 20:56:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:43,343 INFO L93 Difference]: Finished difference Result 791 states and 1270 transitions. [2025-01-09 20:56:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:56:43,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-01-09 20:56:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:43,350 INFO L225 Difference]: With dead ends: 791 [2025-01-09 20:56:43,350 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 20:56:43,352 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-01-09 20:56:43,354 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:43,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:56:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 20:56:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-09 20:56:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 355 states have (on average 1.4563380281690141) internal successors, (517), 355 states have internal predecessors, (517), 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-01-09 20:56:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 523 transitions. [2025-01-09 20:56:43,401 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 523 transitions. Word has length 11 [2025-01-09 20:56:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:43,401 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 523 transitions. [2025-01-09 20:56:43,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-01-09 20:56:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 523 transitions. [2025-01-09 20:56:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:56:43,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:43,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:56:43,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:56:43,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:43,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash -361622491, now seen corresponding path program 1 times [2025-01-09 20:56:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:43,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671509878] [2025-01-09 20:56:43,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:43,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:56:43,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:56:43,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:43,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:56:43,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:43,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671509878] [2025-01-09 20:56:43,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671509878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:43,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:56:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250469530] [2025-01-09 20:56:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:43,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:56:43,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:43,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:56:43,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:56:43,728 INFO L87 Difference]: Start difference. First operand 360 states and 523 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 20:56:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:43,819 INFO L93 Difference]: Finished difference Result 475 states and 689 transitions. [2025-01-09 20:56:43,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:56:43,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-01-09 20:56:43,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:43,821 INFO L225 Difference]: With dead ends: 475 [2025-01-09 20:56:43,821 INFO L226 Difference]: Without dead ends: 318 [2025-01-09 20:56:43,822 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-01-09 20:56:43,823 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 30 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:43,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1247 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:56:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-01-09 20:56:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-01-09 20:56:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.4057507987220448) internal successors, (440), 313 states have internal predecessors, (440), 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-01-09 20:56:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 446 transitions. [2025-01-09 20:56:43,846 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 446 transitions. Word has length 65 [2025-01-09 20:56:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:43,848 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 446 transitions. [2025-01-09 20:56:43,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 20:56:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 446 transitions. [2025-01-09 20:56:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:56:43,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:43,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:56:43,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:56:43,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:43,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1542086863, now seen corresponding path program 1 times [2025-01-09 20:56:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:43,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547206307] [2025-01-09 20:56:43,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:43,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:43,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:56:43,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:56:43,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:43,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:56:44,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:44,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547206307] [2025-01-09 20:56:44,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547206307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:44,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:44,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:56:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595134637] [2025-01-09 20:56:44,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:44,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:56:44,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:44,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:56:44,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:56:44,386 INFO L87 Difference]: Start difference. First operand 318 states and 446 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-01-09 20:56:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:44,516 INFO L93 Difference]: Finished difference Result 746 states and 1042 transitions. [2025-01-09 20:56:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:56:44,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-01-09 20:56:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:44,519 INFO L225 Difference]: With dead ends: 746 [2025-01-09 20:56:44,519 INFO L226 Difference]: Without dead ends: 628 [2025-01-09 20:56:44,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:56:44,520 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 426 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:44,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 2539 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:56:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-01-09 20:56:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 320. [2025-01-09 20:56:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.403174603174603) internal successors, (442), 315 states have internal predecessors, (442), 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-01-09 20:56:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2025-01-09 20:56:44,541 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 65 [2025-01-09 20:56:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:44,541 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2025-01-09 20:56:44,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-01-09 20:56:44,541 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2025-01-09 20:56:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 20:56:44,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:44,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:56:44,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:56:44,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:44,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1310907661, now seen corresponding path program 1 times [2025-01-09 20:56:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:44,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157207781] [2025-01-09 20:56:44,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:44,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 20:56:44,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 20:56:44,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:44,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:56:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:44,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157207781] [2025-01-09 20:56:44,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157207781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:44,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:44,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:56:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656376520] [2025-01-09 20:56:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:44,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:56:44,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:44,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:56:44,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:56:44,818 INFO L87 Difference]: Start difference. First operand 320 states and 448 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-01-09 20:56:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:44,903 INFO L93 Difference]: Finished difference Result 593 states and 825 transitions. [2025-01-09 20:56:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:56:44,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 141 [2025-01-09 20:56:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:44,906 INFO L225 Difference]: With dead ends: 593 [2025-01-09 20:56:44,906 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 20:56:44,907 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-01-09 20:56:44,907 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 30 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:44,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 998 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:56:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 20:56:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-01-09 20:56:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 273 states have (on average 1.336996336996337) internal successors, (365), 273 states have internal predecessors, (365), 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-01-09 20:56:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 371 transitions. [2025-01-09 20:56:44,917 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 371 transitions. Word has length 141 [2025-01-09 20:56:44,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:44,917 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 371 transitions. [2025-01-09 20:56:44,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-01-09 20:56:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 371 transitions. [2025-01-09 20:56:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 20:56:44,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:44,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:56:44,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:56:44,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:44,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash 962613887, now seen corresponding path program 1 times [2025-01-09 20:56:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735485012] [2025-01-09 20:56:44,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:44,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 20:56:44,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 20:56:44,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:44,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:56:45,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:45,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735485012] [2025-01-09 20:56:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735485012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:45,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:45,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:56:45,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078138804] [2025-01-09 20:56:45,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:45,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:56:45,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:45,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:56:45,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:56:45,089 INFO L87 Difference]: Start difference. First operand 278 states and 371 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-01-09 20:56:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:45,140 INFO L93 Difference]: Finished difference Result 732 states and 982 transitions. [2025-01-09 20:56:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:56:45,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 141 [2025-01-09 20:56:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:45,142 INFO L225 Difference]: With dead ends: 732 [2025-01-09 20:56:45,142 INFO L226 Difference]: Without dead ends: 459 [2025-01-09 20:56:45,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-09 20:56:45,143 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 176 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:45,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 808 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:56:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-09 20:56:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2025-01-09 20:56:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 452 states have (on average 1.342920353982301) internal successors, (607), 452 states have internal predecessors, (607), 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-01-09 20:56:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 613 transitions. [2025-01-09 20:56:45,151 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 613 transitions. Word has length 141 [2025-01-09 20:56:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:45,151 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 613 transitions. [2025-01-09 20:56:45,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-01-09 20:56:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 613 transitions. [2025-01-09 20:56:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 20:56:45,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:45,153 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] [2025-01-09 20:56:45,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:56:45,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:45,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash -687495959, now seen corresponding path program 1 times [2025-01-09 20:56:45,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:45,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145039363] [2025-01-09 20:56:45,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:45,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 20:56:45,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 20:56:45,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:45,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:56:45,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:45,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145039363] [2025-01-09 20:56:45,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145039363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:45,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:56:45,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:56:45,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059123315] [2025-01-09 20:56:45,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:45,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:56:45,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:45,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:56:45,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:56:45,369 INFO L87 Difference]: Start difference. First operand 457 states and 613 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-01-09 20:56:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:45,558 INFO L93 Difference]: Finished difference Result 902 states and 1210 transitions. [2025-01-09 20:56:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:56:45,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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 156 [2025-01-09 20:56:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:45,561 INFO L225 Difference]: With dead ends: 902 [2025-01-09 20:56:45,561 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 20:56:45,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:56:45,562 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 1128 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:45,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 864 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:56:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 20:56:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 365. [2025-01-09 20:56:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.336111111111111) internal successors, (481), 360 states have internal predecessors, (481), 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-01-09 20:56:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 487 transitions. [2025-01-09 20:56:45,572 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 487 transitions. Word has length 156 [2025-01-09 20:56:45,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:45,572 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 487 transitions. [2025-01-09 20:56:45,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-01-09 20:56:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 487 transitions. [2025-01-09 20:56:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 20:56:45,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:45,573 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, 1, 1, 1, 1] [2025-01-09 20:56:45,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:56:45,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:45,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2097382374, now seen corresponding path program 1 times [2025-01-09 20:56:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:45,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357217383] [2025-01-09 20:56:45,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:45,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:45,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 20:56:45,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 20:56:45,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:56:46,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:46,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357217383] [2025-01-09 20:56:46,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357217383] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:56:46,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902691789] [2025-01-09 20:56:46,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:46,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:56:46,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:56:46,078 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-01-09 20:56:46,079 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-01-09 20:56:46,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 20:56:46,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 20:56:46,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:46,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:46,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 20:56:46,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:56:46,415 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-01-09 20:56:46,436 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 16 treesize of output 17 [2025-01-09 20:56:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:56:47,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:56:47,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902691789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:47,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:56:47,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 20:56:47,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020439845] [2025-01-09 20:56:47,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:47,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:56:47,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:47,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:56:47,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:56:47,228 INFO L87 Difference]: Start difference. First operand 365 states and 487 transitions. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 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-01-09 20:56:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:48,106 INFO L93 Difference]: Finished difference Result 867 states and 1161 transitions. [2025-01-09 20:56:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:56:48,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 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 166 [2025-01-09 20:56:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:48,108 INFO L225 Difference]: With dead ends: 867 [2025-01-09 20:56:48,108 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 20:56:48,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-09 20:56:48,109 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 465 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:48,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1791 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 20:56:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 20:56:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 365. [2025-01-09 20:56:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.3333333333333333) internal successors, (480), 360 states have internal predecessors, (480), 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-01-09 20:56:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 486 transitions. [2025-01-09 20:56:48,134 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 486 transitions. Word has length 166 [2025-01-09 20:56:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:48,134 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 486 transitions. [2025-01-09 20:56:48,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 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-01-09 20:56:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 486 transitions. [2025-01-09 20:56:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 20:56:48,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:48,136 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, 1, 1, 1, 1, 1] [2025-01-09 20:56:48,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:56:48,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:56:48,337 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash -88424173, now seen corresponding path program 1 times [2025-01-09 20:56:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168886965] [2025-01-09 20:56:48,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:48,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:48,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 20:56:48,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 20:56:48,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:48,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:56:48,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168886965] [2025-01-09 20:56:48,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168886965] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:56:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672252119] [2025-01-09 20:56:48,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:48,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:56:48,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:56:48,721 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-01-09 20:56:48,722 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-01-09 20:56:48,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 20:56:48,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 20:56:48,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:48,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:48,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 20:56:48,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:56:49,001 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-01-09 20:56:49,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 20:56:49,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-01-09 20:56:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:56:49,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:56:49,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672252119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:56:49,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:56:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-01-09 20:56:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272390] [2025-01-09 20:56:49,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:56:49,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:56:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:56:49,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:56:49,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:56:49,504 INFO L87 Difference]: Start difference. First operand 365 states and 486 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 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-01-09 20:56:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:56:50,135 INFO L93 Difference]: Finished difference Result 662 states and 879 transitions. [2025-01-09 20:56:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:56:50,136 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 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 167 [2025-01-09 20:56:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:56:50,138 INFO L225 Difference]: With dead ends: 662 [2025-01-09 20:56:50,138 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 20:56:50,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-01-09 20:56:50,139 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 359 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:56:50,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 2048 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:56:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 20:56:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 401. [2025-01-09 20:56:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3131313131313131) internal successors, (520), 396 states have internal predecessors, (520), 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-01-09 20:56:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 526 transitions. [2025-01-09 20:56:50,154 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 526 transitions. Word has length 167 [2025-01-09 20:56:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:56:50,154 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 526 transitions. [2025-01-09 20:56:50,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 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-01-09 20:56:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 526 transitions. [2025-01-09 20:56:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 20:56:50,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:56:50,156 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, 1, 1, 1, 1, 1, 1] [2025-01-09 20:56:50,168 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-01-09 20:56:50,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:56:50,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:56:50,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:56:50,362 INFO L85 PathProgramCache]: Analyzing trace with hash 7073783, now seen corresponding path program 1 times [2025-01-09 20:56:50,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:56:50,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516702920] [2025-01-09 20:56:50,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:50,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:56:50,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:56:50,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:56:50,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:50,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:56:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:56:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516702920] [2025-01-09 20:56:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516702920] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:56:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109803858] [2025-01-09 20:56:50,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:56:50,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:56:50,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:56:50,664 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-01-09 20:56:50,668 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-01-09 20:56:50,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:56:51,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:56:51,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:56:51,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:56:51,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 20:56:51,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:57:23,978 WARN L286 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 20:57:55,978 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 20:58:12,281 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)