./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-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_SAX_test5-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 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:54:57,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:54:57,867 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:54:57,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:54:57,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:54:57,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:54:57,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:54:57,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:54:57,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:54:57,898 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:54:57,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:54:57,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:54:57,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:54:57,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:54:57,899 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:54:57,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:54:57,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:54:57,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:54:57,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:54:57,900 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:54:57,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:54:57,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:54:57,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:54:57,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:54:57,901 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:54:57,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:54:57,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:54:57,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:54:57,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:54:57,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:54:57,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:54:57,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:54:57,901 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 -> 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 [2025-01-09 20:54:58,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:54:58,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:54:58,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:54:58,151 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:54:58,151 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:54:58,152 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_SAX_test5-2.i [2025-01-09 20:54:59,317 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2d234eba/94cf764b5eec4317ac727dec6c2b3a61/FLAGd87c4fee1 [2025-01-09 20:54:59,642 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:54:59,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2025-01-09 20:54:59,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2d234eba/94cf764b5eec4317ac727dec6c2b3a61/FLAGd87c4fee1 [2025-01-09 20:54:59,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2d234eba/94cf764b5eec4317ac727dec6c2b3a61 [2025-01-09 20:54:59,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:54:59,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:54:59,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:54:59,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:54:59,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:54:59,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:54:59,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eea893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:59, skipping insertion in model container [2025-01-09 20:54:59,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:54:59" (1/1) ... [2025-01-09 20:54:59,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:55:00,000 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_SAX_test5-2.i[33021,33034] [2025-01-09 20:55:00,109 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_SAX_test5-2.i[49681,49694] [2025-01-09 20:55:00,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:55:00,136 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:55:00,174 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_SAX_test5-2.i[33021,33034] [2025-01-09 20:55:00,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i[49681,49694] [2025-01-09 20:55:00,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:55:00,258 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:55:00,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00 WrapperNode [2025-01-09 20:55:00,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:55:00,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:55:00,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:55:00,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:55:00,264 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:55:00" (1/1) ... [2025-01-09 20:55:00,291 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:55:00" (1/1) ... [2025-01-09 20:55:00,342 INFO L138 Inliner]: procedures = 177, calls = 424, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2133 [2025-01-09 20:55:00,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:55:00,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:55:00,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:55:00,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:55:00,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,471 INFO L175 MemorySlicer]: Split 397 memory accesses to 3 slices as follows [2, 24, 371]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 91 writes are split as follows [0, 1, 90]. [2025-01-09 20:55:00,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:55:00,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:55:00,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:55:00,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:55:00,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (1/1) ... [2025-01-09 20:55:00,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:55:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:00,603 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:55:00,607 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:55:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:55:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:55:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:55:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:55:00,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:55:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:55:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:55:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:55:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:55:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:55:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:55:00,626 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:55:00,627 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:55:00,627 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:55:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:55:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:55:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:55:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:55:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:55:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:55:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:55:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:55:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:55:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:55:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:55:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:55:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:55:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:55:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:55:00,829 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:55:00,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:55:02,498 INFO L? ?]: Removed 508 outVars from TransFormulas that were not future-live. [2025-01-09 20:55:02,498 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:55:02,521 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:55:02,522 INFO L312 CfgBuilder]: Removed 43 assume(true) statements. [2025-01-09 20:55:02,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:55:02 BoogieIcfgContainer [2025-01-09 20:55:02,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:55:02,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:55:02,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:55:02,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:55:02,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:54:59" (1/3) ... [2025-01-09 20:55:02,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbd5036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:55:02, skipping insertion in model container [2025-01-09 20:55:02,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:55:00" (2/3) ... [2025-01-09 20:55:02,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbd5036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:55:02, skipping insertion in model container [2025-01-09 20:55:02,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:55:02" (3/3) ... [2025-01-09 20:55:02,536 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-2.i [2025-01-09 20:55:02,548 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:55:02,549 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test5-2.i that has 5 procedures, 605 locations, 1 initial locations, 54 loop locations, and 2 error locations. [2025-01-09 20:55:02,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:55:02,628 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;@7824919b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:55:02,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:55:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 597 states, 581 states have (on average 1.6161790017211703) internal successors, (939), 588 states have internal predecessors, (939), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 20:55:02,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:02,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:55:02,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:02,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:02,647 INFO L85 PathProgramCache]: Analyzing trace with hash -557051575, now seen corresponding path program 1 times [2025-01-09 20:55:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923558349] [2025-01-09 20:55:02,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:02,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 20:55:02,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 20:55:02,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:02,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:02,781 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:55:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923558349] [2025-01-09 20:55:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923558349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:02,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:55:02,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982849190] [2025-01-09 20:55:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:02,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:55:02,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:02,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:55:02,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:55:02,811 INFO L87 Difference]: Start difference. First operand has 597 states, 581 states have (on average 1.6161790017211703) internal successors, (939), 588 states have internal predecessors, (939), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:02,874 INFO L93 Difference]: Finished difference Result 1192 states and 1925 transitions. [2025-01-09 20:55:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:55:02,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 20:55:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:02,885 INFO L225 Difference]: With dead ends: 1192 [2025-01-09 20:55:02,885 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 20:55:02,891 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:55:02,893 INFO L435 NwaCegarLoop]: 869 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, 869 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:55:02,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 20:55:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-01-09 20:55:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 546 states have (on average 1.4615384615384615) internal successors, (798), 552 states have internal predecessors, (798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 820 transitions. [2025-01-09 20:55:02,943 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 820 transitions. Word has length 7 [2025-01-09 20:55:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:02,944 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 820 transitions. [2025-01-09 20:55:02,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:55:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 820 transitions. [2025-01-09 20:55:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 20:55:02,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:02,946 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] [2025-01-09 20:55:02,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:55:02,946 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:02,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1284923811, now seen corresponding path program 1 times [2025-01-09 20:55:02,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:02,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244582763] [2025-01-09 20:55:02,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:02,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:02,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 20:55:02,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 20:55:02,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:02,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:03,141 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:55:03,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:03,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244582763] [2025-01-09 20:55:03,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244582763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:03,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:03,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:03,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967533830] [2025-01-09 20:55:03,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:03,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:03,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:03,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:03,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:03,143 INFO L87 Difference]: Start difference. First operand 561 states and 820 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:55:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:03,222 INFO L93 Difference]: Finished difference Result 1283 states and 1886 transitions. [2025-01-09 20:55:03,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:03,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2025-01-09 20:55:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:03,227 INFO L225 Difference]: With dead ends: 1283 [2025-01-09 20:55:03,228 INFO L226 Difference]: Without dead ends: 1110 [2025-01-09 20:55:03,229 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:55:03,229 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 784 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:03,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1723 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-01-09 20:55:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 562. [2025-01-09 20:55:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 553 states have internal predecessors, (799), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 821 transitions. [2025-01-09 20:55:03,272 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 821 transitions. Word has length 60 [2025-01-09 20:55:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:03,272 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 821 transitions. [2025-01-09 20:55:03,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:55:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 821 transitions. [2025-01-09 20:55:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:55:03,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:03,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:03,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:55:03,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:03,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1309299646, now seen corresponding path program 1 times [2025-01-09 20:55:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:03,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952684099] [2025-01-09 20:55:03,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:03,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:55:03,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:55:03,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:03,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:55:03,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:03,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952684099] [2025-01-09 20:55:03,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952684099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:03,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:55:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414814015] [2025-01-09 20:55:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:03,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:55:03,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:03,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:55:03,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:55:03,827 INFO L87 Difference]: Start difference. First operand 562 states and 821 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:55:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:03,907 INFO L93 Difference]: Finished difference Result 1124 states and 1642 transitions. [2025-01-09 20:55:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:55:03,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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 204 [2025-01-09 20:55:03,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:03,910 INFO L225 Difference]: With dead ends: 1124 [2025-01-09 20:55:03,911 INFO L226 Difference]: Without dead ends: 565 [2025-01-09 20:55:03,912 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:55:03,913 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 105 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:03,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2286 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-01-09 20:55:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 562. [2025-01-09 20:55:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 547 states have (on average 1.4478976234003655) internal successors, (792), 553 states have internal predecessors, (792), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2025-01-09 20:55:03,930 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 204 [2025-01-09 20:55:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:03,931 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2025-01-09 20:55:03,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:55:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2025-01-09 20:55:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:55:03,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:03,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:03,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:55:03,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:03,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:03,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1509611978, now seen corresponding path program 1 times [2025-01-09 20:55:03,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:03,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870381354] [2025-01-09 20:55:03,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:03,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:04,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:55:04,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:55:04,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:04,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:55:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870381354] [2025-01-09 20:55:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870381354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:04,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:04,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363948444] [2025-01-09 20:55:04,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:04,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:04,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:04,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:04,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:04,213 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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:55:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:04,290 INFO L93 Difference]: Finished difference Result 1127 states and 1634 transitions. [2025-01-09 20:55:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:04,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 204 [2025-01-09 20:55:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:04,293 INFO L225 Difference]: With dead ends: 1127 [2025-01-09 20:55:04,293 INFO L226 Difference]: Without dead ends: 568 [2025-01-09 20:55:04,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:55:04,295 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 1 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:04,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1592 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-09 20:55:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-01-09 20:55:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 553 states have (on average 1.4430379746835442) internal successors, (798), 559 states have internal predecessors, (798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 820 transitions. [2025-01-09 20:55:04,311 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 820 transitions. Word has length 204 [2025-01-09 20:55:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:04,311 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 820 transitions. [2025-01-09 20:55:04,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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:55:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 820 transitions. [2025-01-09 20:55:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:55:04,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:04,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:04,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:55:04,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:04,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1490070856, now seen corresponding path program 1 times [2025-01-09 20:55:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715515603] [2025-01-09 20:55:04,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:04,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:55:04,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:55:04,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:04,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:55:04,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:04,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715515603] [2025-01-09 20:55:04,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715515603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:04,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:04,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548126756] [2025-01-09 20:55:04,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:04,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:04,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:04,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:04,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:04,514 INFO L87 Difference]: Start difference. First operand 568 states and 820 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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:55:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:04,576 INFO L93 Difference]: Finished difference Result 1267 states and 1831 transitions. [2025-01-09 20:55:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 204 [2025-01-09 20:55:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:04,581 INFO L225 Difference]: With dead ends: 1267 [2025-01-09 20:55:04,581 INFO L226 Difference]: Without dead ends: 702 [2025-01-09 20:55:04,583 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:55:04,584 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 134 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:04,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1617 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-01-09 20:55:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-01-09 20:55:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 687 states have (on average 1.4425036390101893) internal successors, (991), 693 states have internal predecessors, (991), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1013 transitions. [2025-01-09 20:55:04,605 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1013 transitions. Word has length 204 [2025-01-09 20:55:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:04,606 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1013 transitions. [2025-01-09 20:55:04,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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:55:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1013 transitions. [2025-01-09 20:55:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:55:04,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:04,609 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:04,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:55:04,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:04,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash -892850850, now seen corresponding path program 1 times [2025-01-09 20:55:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:04,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362386732] [2025-01-09 20:55:04,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:04,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:55:04,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:55:04,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:04,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:55:04,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:04,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362386732] [2025-01-09 20:55:04,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362386732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:04,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:04,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:55:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331311871] [2025-01-09 20:55:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:04,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:55:04,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:04,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:55:04,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:55:04,997 INFO L87 Difference]: Start difference. First operand 702 states and 1013 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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:55:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:05,076 INFO L93 Difference]: Finished difference Result 1225 states and 1764 transitions. [2025-01-09 20:55:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:55:05,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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 219 [2025-01-09 20:55:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:05,079 INFO L225 Difference]: With dead ends: 1225 [2025-01-09 20:55:05,079 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 20:55:05,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:55:05,081 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 33 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:05,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2115 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 20:55:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-09 20:55:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 645 states have (on average 1.4170542635658914) internal successors, (914), 651 states have internal predecessors, (914), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 936 transitions. [2025-01-09 20:55:05,094 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 936 transitions. Word has length 219 [2025-01-09 20:55:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:05,094 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 936 transitions. [2025-01-09 20:55:05,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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:55:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 936 transitions. [2025-01-09 20:55:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:55:05,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:05,097 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:05,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:55:05,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:05,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:05,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1227373548, now seen corresponding path program 1 times [2025-01-09 20:55:05,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:05,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74842710] [2025-01-09 20:55:05,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:05,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:05,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:55:05,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:55:05,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:05,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:55:05,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:05,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74842710] [2025-01-09 20:55:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74842710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:05,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:05,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:05,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041055445] [2025-01-09 20:55:05,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:05,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:05,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:05,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:05,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:05,373 INFO L87 Difference]: Start difference. First operand 660 states and 936 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:55:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:05,422 INFO L93 Difference]: Finished difference Result 1183 states and 1676 transitions. [2025-01-09 20:55:05,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:05,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 219 [2025-01-09 20:55:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:05,425 INFO L225 Difference]: With dead ends: 1183 [2025-01-09 20:55:05,425 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 20:55:05,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:55:05,428 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 1 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:05,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1426 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 20:55:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-09 20:55:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 645 states have (on average 1.4124031007751938) internal successors, (911), 651 states have internal predecessors, (911), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:55:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 933 transitions. [2025-01-09 20:55:05,445 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 933 transitions. Word has length 219 [2025-01-09 20:55:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:05,446 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 933 transitions. [2025-01-09 20:55:05,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:55:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 933 transitions. [2025-01-09 20:55:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:55:05,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:05,448 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:05,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:55:05,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:05,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1044174744, now seen corresponding path program 1 times [2025-01-09 20:55:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:05,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918811199] [2025-01-09 20:55:05,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:05,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:05,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:55:05,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:55:05,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:05,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:55:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918811199] [2025-01-09 20:55:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918811199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:05,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:55:05,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:55:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936526608] [2025-01-09 20:55:05,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:05,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:05,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:05,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:05,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:55:05,793 INFO L87 Difference]: Start difference. First operand 660 states and 933 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:55:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:05,859 INFO L93 Difference]: Finished difference Result 1474 states and 2087 transitions. [2025-01-09 20:55:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:05,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 219 [2025-01-09 20:55:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:05,868 INFO L225 Difference]: With dead ends: 1474 [2025-01-09 20:55:05,868 INFO L226 Difference]: Without dead ends: 951 [2025-01-09 20:55:05,869 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:55:05,869 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 454 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1639 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:55:05,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1639 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-01-09 20:55:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 949. [2025-01-09 20:55:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 926 states have (on average 1.4136069114470842) internal successors, (1309), 937 states have internal predecessors, (1309), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:55:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1347 transitions. [2025-01-09 20:55:05,898 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1347 transitions. Word has length 219 [2025-01-09 20:55:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:05,898 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1347 transitions. [2025-01-09 20:55:05,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:55:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1347 transitions. [2025-01-09 20:55:05,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:55:05,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:05,901 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:05,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:55:05,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:05,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:05,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2097940128, now seen corresponding path program 1 times [2025-01-09 20:55:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:05,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576314237] [2025-01-09 20:55:05,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:05,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:05,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:06,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:06,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:06,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:06,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576314237] [2025-01-09 20:55:06,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576314237] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:55:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395088781] [2025-01-09 20:55:06,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:06,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:06,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:06,287 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:55:06,288 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:55:06,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:06,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:06,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:06,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:06,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:55:06,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:55:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:55:06,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:55:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395088781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:06,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:55:06,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 20:55:06,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518828215] [2025-01-09 20:55:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:06,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:55:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:06,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:55:06,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:55:06,774 INFO L87 Difference]: Start difference. First operand 949 states and 1347 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:06,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:06,846 INFO L93 Difference]: Finished difference Result 1306 states and 1885 transitions. [2025-01-09 20:55:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:55:06,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:55:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:06,851 INFO L225 Difference]: With dead ends: 1306 [2025-01-09 20:55:06,852 INFO L226 Difference]: Without dead ends: 989 [2025-01-09 20:55:06,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:55:06,855 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 8 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:06,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1405 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-01-09 20:55:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2025-01-09 20:55:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 966 states have (on average 1.39648033126294) internal successors, (1349), 977 states have internal predecessors, (1349), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:55:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1387 transitions. [2025-01-09 20:55:06,882 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1387 transitions. Word has length 234 [2025-01-09 20:55:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:06,882 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1387 transitions. [2025-01-09 20:55:06,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1387 transitions. [2025-01-09 20:55:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:55:06,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:06,885 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:06,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 20:55:07,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:07,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:07,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:07,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1068580830, now seen corresponding path program 1 times [2025-01-09 20:55:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:07,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582904446] [2025-01-09 20:55:07,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:07,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:07,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:07,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:07,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:07,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:07,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:07,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582904446] [2025-01-09 20:55:07,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582904446] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:55:07,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120424780] [2025-01-09 20:55:07,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:07,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:07,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:07,431 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:55:07,433 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:55:07,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:07,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:07,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:07,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:07,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:55:07,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:55:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:55:07,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:55:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120424780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:07,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:55:07,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:55:07,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876206342] [2025-01-09 20:55:07,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:07,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:55:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:07,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:55:07,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:55:07,933 INFO L87 Difference]: Start difference. First operand 989 states and 1387 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:08,001 INFO L93 Difference]: Finished difference Result 1318 states and 1877 transitions. [2025-01-09 20:55:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:55:08,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:55:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:08,006 INFO L225 Difference]: With dead ends: 1318 [2025-01-09 20:55:08,006 INFO L226 Difference]: Without dead ends: 961 [2025-01-09 20:55:08,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:08,007 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 106 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:08,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 2016 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-01-09 20:55:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2025-01-09 20:55:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 938 states have (on average 1.3933901918976546) internal successors, (1307), 949 states have internal predecessors, (1307), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:55:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1345 transitions. [2025-01-09 20:55:08,029 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1345 transitions. Word has length 234 [2025-01-09 20:55:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:08,029 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1345 transitions. [2025-01-09 20:55:08,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1345 transitions. [2025-01-09 20:55:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:55:08,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:08,032 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:08,041 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:55:08,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:08,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:08,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:08,237 INFO L85 PathProgramCache]: Analyzing trace with hash -346294254, now seen corresponding path program 1 times [2025-01-09 20:55:08,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:08,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630517771] [2025-01-09 20:55:08,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:08,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:08,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:08,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:08,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:08,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630517771] [2025-01-09 20:55:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630517771] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:55:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654664905] [2025-01-09 20:55:08,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:08,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:08,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:08,508 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:55:08,510 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:55:08,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:08,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:08,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:08,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:08,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 20:55:08,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:55:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:55:09,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:55:09,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654664905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:55:09,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:55:09,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:55:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101415974] [2025-01-09 20:55:09,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:55:09,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:55:09,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:09,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:55:09,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:55:09,022 INFO L87 Difference]: Start difference. First operand 961 states and 1345 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:09,081 INFO L93 Difference]: Finished difference Result 1182 states and 1653 transitions. [2025-01-09 20:55:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:55:09,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:55:09,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:09,085 INFO L225 Difference]: With dead ends: 1182 [2025-01-09 20:55:09,085 INFO L226 Difference]: Without dead ends: 853 [2025-01-09 20:55:09,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:09,087 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 9 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:09,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1865 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:55:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-01-09 20:55:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2025-01-09 20:55:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 830 states have (on average 1.3674698795180722) internal successors, (1135), 841 states have internal predecessors, (1135), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:55:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1173 transitions. [2025-01-09 20:55:09,111 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1173 transitions. Word has length 234 [2025-01-09 20:55:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:09,112 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1173 transitions. [2025-01-09 20:55:09,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:55:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1173 transitions. [2025-01-09 20:55:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:55:09,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:09,115 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:09,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 20:55:09,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:09,316 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:09,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash 683065044, now seen corresponding path program 1 times [2025-01-09 20:55:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:09,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650076069] [2025-01-09 20:55:09,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:09,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:09,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:09,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:09,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650076069] [2025-01-09 20:55:09,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650076069] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:55:09,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808673122] [2025-01-09 20:55:09,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:09,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:09,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:09,602 INFO L229 MonitoredProcess]: Starting monitored process 5 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:55:09,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 20:55:09,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:55:10,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:55:10,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:10,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:10,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:55:10,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:55:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:10,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:55:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:10,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808673122] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:55:10,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:55:10,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 20:55:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769549721] [2025-01-09 20:55:10,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:55:10,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:55:10,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:10,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:55:10,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:10,469 INFO L87 Difference]: Start difference. First operand 853 states and 1173 transitions. Second operand has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:55:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:10,608 INFO L93 Difference]: Finished difference Result 2180 states and 3005 transitions. [2025-01-09 20:55:10,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:55:10,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 234 [2025-01-09 20:55:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:10,615 INFO L225 Difference]: With dead ends: 2180 [2025-01-09 20:55:10,615 INFO L226 Difference]: Without dead ends: 1959 [2025-01-09 20:55:10,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:55:10,616 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 4275 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4306 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:10,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4306 Valid, 2477 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:55:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2025-01-09 20:55:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1608. [2025-01-09 20:55:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1570 states have (on average 1.3617834394904458) internal successors, (2138), 1581 states have internal predecessors, (2138), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 20:55:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2206 transitions. [2025-01-09 20:55:10,677 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2206 transitions. Word has length 234 [2025-01-09 20:55:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:10,677 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2206 transitions. [2025-01-09 20:55:10,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:55:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2206 transitions. [2025-01-09 20:55:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-01-09 20:55:10,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:10,685 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:10,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 20:55:10,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 20:55:10,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:10,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 360663777, now seen corresponding path program 1 times [2025-01-09 20:55:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244060406] [2025-01-09 20:55:10,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:11,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 20:55:11,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 20:55:11,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:11,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 4 proven. 526 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 20:55:11,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:55:11,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244060406] [2025-01-09 20:55:11,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244060406] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:55:11,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45704584] [2025-01-09 20:55:11,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:11,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:55:11,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:55:11,877 INFO L229 MonitoredProcess]: Starting monitored process 6 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:55:11,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 20:55:12,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 20:55:12,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 20:55:12,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:55:12,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:55:12,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 3255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:55:12,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:55:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:13,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:55:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:55:13,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45704584] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:55:13,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:55:13,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-01-09 20:55:13,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493422907] [2025-01-09 20:55:13,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:55:13,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 20:55:13,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:55:13,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 20:55:13,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-01-09 20:55:13,875 INFO L87 Difference]: Start difference. First operand 1608 states and 2206 transitions. Second operand has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 20:55:19,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:55:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:55:22,915 INFO L93 Difference]: Finished difference Result 14778 states and 20405 transitions. [2025-01-09 20:55:22,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 20:55:22,916 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 666 [2025-01-09 20:55:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:55:22,965 INFO L225 Difference]: With dead ends: 14778 [2025-01-09 20:55:22,965 INFO L226 Difference]: Without dead ends: 13798 [2025-01-09 20:55:22,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1322 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1240, Invalid=3590, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 20:55:22,972 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 32194 mSDsluCounter, 12603 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32194 SdHoareTripleChecker+Valid, 13999 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:55:22,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32194 Valid, 13999 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-01-09 20:55:22,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13798 states. [2025-01-09 20:55:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13798 to 9335. [2025-01-09 20:55:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9335 states, 9205 states have (on average 1.367191743617599) internal successors, (12585), 9221 states have internal predecessors, (12585), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 20:55:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9335 states to 9335 states and 12837 transitions. [2025-01-09 20:55:23,244 INFO L78 Accepts]: Start accepts. Automaton has 9335 states and 12837 transitions. Word has length 666 [2025-01-09 20:55:23,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:55:23,245 INFO L471 AbstractCegarLoop]: Abstraction has 9335 states and 12837 transitions. [2025-01-09 20:55:23,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 20:55:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 9335 states and 12837 transitions. [2025-01-09 20:55:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1541 [2025-01-09 20:55:23,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:55:23,300 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:23,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 20:55:23,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 20:55:23,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:55:23,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:55:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2093295754, now seen corresponding path program 1 times [2025-01-09 20:55:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:55:23,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257375732] [2025-01-09 20:55:23,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:55:23,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:55:23,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1540 statements into 1 equivalence classes.